Submission #1325871

#	Time	Username	Problem	Language	Result	Execution time	Memory
1325871		nguyenkhangninh99	Financial Report (JOI21_financial)	C++20	100 / 100	501 ms	37964 KiB

Main

#include <bits/stdc++.h>
using namespace std;

#define int long long
const int maxn = 3e5 + 5;
int a[maxn], b[maxn], st[4 * maxn];
vector<int> pos[maxn];
set<pair<int, int>> s;
set<int> wall;

void update(int id, int l, int r, int p, int val){
    if(l == r) st[id] = val;
    else{
        int mid = (l + r) / 2;
        if(p <= mid) update(id * 2, l, mid, p, val);
        else update(id * 2 + 1, mid + 1, r, p, val);
        st[id] = max(st[id * 2], st[id * 2 + 1]);
    }
}

int get(int id, int l, int r, int u, int v){
    if(v < l || r < u) return 0;
    if(u <= l && r <= v) return st[id];
    int mid = (l + r) / 2;
    return max(get(id * 2, l, mid, u, v), get(id * 2 + 1, mid + 1, r, u, v));
}
signed main(){
    ios_base::sync_with_stdio(false);
    cin.tie(0); cout.tie(0);
    
    int n, m; cin >> n >> m;
    for(int i = 1; i <= n; i++){
        cin >> a[i];
        b[i] = a[i];
    }
    sort(b + 1, b + n + 1);
    int len = unique(b + 1, b + n + 1) - b - 1;
    
    for(int i = n; i >= 1; i--){
        a[i] = lower_bound(b + 1, b + len + 1, a[i]) - b;
        pos[a[i]].push_back(i);
    }
    
    s.insert({1, n});
    wall.insert(0);
    if(n >= m) wall.insert(n);
    
    for(int v = 1; v <= len; v++){
        for(int u: pos[v]){
            auto it = prev(s.lower_bound({u, 1e9}));
            auto [l, r] = *it;
            s.erase(it);
            if(r - l + 1 >= m) wall.erase(r);
            
            if(u > l){
                s.insert({l, u - 1});
                if(u - l >= m) wall.insert(u - 1);
            }
            if(r > u){
                s.insert({u + 1, r});
                if(r - u >= m) wall.insert(r);
            }
            update(1, 0, n, u, get(1, 0, n, *(prev(wall.lower_bound(u))), u - 1) + 1);
        }
    }
    cout << st[1];
}

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