Submission #66333334

Source Code Expand

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
static const ll NEG_INF = -(ll)1e18;
struct SegTree {
    int n, size;
    vector<ll> t;
    SegTree(int _n) {
        n = _n;
        size = 1;
        while (size < n) size <<= 1;
        t.assign(2*size, NEG_INF);
    }
    void update(int idx, ll v) {
        int p = idx + size;
        t[p] = v;
        while (p > 1) {
            p >>= 1;
            t[p] = max(t[p<<1], t[(p<<1)|1]);
        }
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

#include <bits/stdc++.h>
using namespace std;
using ll = long long;
static const ll NEG_INF = -(ll)1e18;

struct SegTree {
    int n, size;
    vector<ll> t;
    SegTree(int _n) {
        n = _n;
        size = 1;
        while (size < n) size <<= 1;
        t.assign(2*size, NEG_INF);
    }
    void update(int idx, ll v) {
        int p = idx + size;
        t[p] = v;
        while (p > 1) {
            p >>= 1;
            t[p] = max(t[p<<1], t[(p<<1)|1]);
        }
    }
    ll query(int l, int r) {
        if (l > r) return NEG_INF;
        l += size; 
        r += size;
        ll res = NEG_INF;
        while (l <= r) {
            if (l & 1) res = max(res, t[l++]);
            if (!(r & 1)) res = max(res, t[r--]);
            l >>= 1;
            r >>= 1;
        }
        return res;
    }
};

int main(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int N;
    ll D, R;
    cin >> N >> D >> R;

    vector<int> H(N);
    for (int i = 0; i < N; i++) {
        cin >> H[i];
    }
    vector<int> pos(N+1);
    for (int i = 0; i < N; i++) {
        pos[ H[i] ] = i;
    }
    vector<ll> dp(N, 0);

    SegTree st(N);
    int k = 1;
    ll answer = 0;

    for (int h = 1; h <= N; h++) {
        int i = pos[h];
        while (k <= N && k <= h - D) {
            int j = pos[k];
            st.update(j, dp[j]);
            k++;
        }

        int left  = max(0, i - (int)R);
        int right = min(N - 1, i + (int)R);

        ll mx = st.query(left, right);

        if (mx < 0) {
            dp[i] = 0;
        } else {
            dp[i] = 1 + mx;
        }
        answer = max(answer, dp[i]);
    }
    cout << answer << "\n";
    return 0;
}

Submission Info

Judge Result