Submission #1226209

#	Time	Username	Problem	Language	Result	Execution time	Memory
1226209		overwatch9	Financial Report (JOI21_financial)	C++20	5 / 100	486 ms	28584 KiB

Main

#include <bits/stdc++.h>
using namespace std;
struct stree {
    #define lc v*2
    #define rc v*2+1
    vector <int> tree;
    stree (int s) {
        tree.resize(s*4, -1);
    }
    void pushup(int v) {
        tree[v] = max(tree[lc], tree[rc]);
    }
    void update(int v, int tl, int tr, int p, int val) {
        if (tl > p || tr < p)
            return;
        if (tl == tr) {
            tree[v] = val;
            return;
        }
        int tm = (tl + tr) / 2;
        update(lc, tl, tm, p, val);
        update(rc, tm+1, tr, p, val);
        pushup(v);
    }
    int query(int v, int tl, int tr, int l, int r) {
        if (tl > r || tr < l)
            return -1;
        if (tl >= l && tr <= r)
            return tree[v];
        int tm = (tl + tr) / 2;
        int a = query(lc, tl, tm, l, r);
        int b = query(rc, tm+1, tr, l, r);
        return max(a, b);
    }
};
vector <int> compressed;
int get_id(int x) {
    return lower_bound(compressed.begin(), compressed.end(), x) - compressed.begin();
}
int main() {
    int n, d;
    cin >> n >> d;
    vector <int> nums(n+1);
    compressed.resize(n+3);
    compressed[n+2] = -1e9;
    compressed[n+1] = -1;
    for (int i = 1; i <= n; i++) {
        cin >> nums[i];
        compressed[i] = nums[i];
        compressed.push_back(nums[i]-1);
    }
    nums[0] = -1;
    sort(compressed.begin(), compressed.end());
    compressed.erase(unique(compressed.begin(), compressed.end()), compressed.end());
    int sz = compressed.size();
    stree tree(sz);
    vector <int> dp(n+1);
    multiset <int> s;
    s.insert(get_id(nums[0]));
    for (int i = 1; i <= n; i++) {
        dp[i] = 1;
        int x = tree.query(1, 1, sz, 1, max(1, get_id(nums[i]-1)));
        dp[i] = max(dp[i], x + 1);
        x = tree.query(1, 1, sz, get_id(nums[i]), get_id(nums[i]));
        dp[i] = max(dp[i], x);
        s.insert(get_id(nums[i]));

        tree.update(1, 1, sz, get_id(nums[i]), dp[i]);
        if (i-d >= 1) {
            s.erase(s.find(get_id(nums[i-d])));
            // if (s.find(get_id(nums[i-d])) == s.end()) {
            //     tree.update(1, 1, sz, get_id(nums[i-d]), -1);
            // }
        }
    }
    cout << *max_element(dp.begin(), dp.end()) << '\n';
    // cout << 3 << '\n';
}

• Subtask 1: 0 / 14
• Subtask 2: 0 / 14
• Subtask 3: 0 / 20
• Subtask 4: 0 / 12
• Subtask 5: 5 / 5
• Subtask 6: 0 / 35