Submission #420000

#	Time	Username	Problem	Language	Result	Execution time	Memory
420000		davi_bart	Financial Report (JOI21_financial)	C++17	48 / 100	4073 ms	7500 KiB

Main

#pragma GCC optimize("O3")
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define int ll
#define fi first
#define se second
#define ld long double
#define pb push_back
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
int N,D;
vector<int> v;
int memo[300010];
int val[300010];
struct min_queue{
    deque<pair<int,int> >q;
    int top(){
        return q.front().fi;
    }
    void insert(int v,int t){
        while(q.size() && q.back().fi>=v)q.pop_back();
        q.pb({v,t});
    }
    void pop(int t){
        while(q.size() && q.front().se<=t)q.pop_front();
    }
}q;
signed main(){
	ios::sync_with_stdio(false);cin.tie(0);
    cin>>N>>D;
    v.pb(0);
    for(int i=0;i<N;i++){
        int a;cin>>a;
        v.pb(a);
    }
    for(int i=0;i<N;i++){
        q.insert(v[i],i);
        q.pop(i-D);
        val[i]=q.top();
    }
    int ans=0;
    for(int i=1;i<=N;i++){
        memo[i]=1;
        for(int j=i-1;j>=0;j--){
            if(val[j]>=v[i])break;
            if(v[j]<v[i]){
                memo[i]=max(memo[i],memo[j]+1);
            }
        }
        ans=max(ans,memo[i]);
        //cout<<memo[i]<<" ";
    }
    //cout<<endl;
    cout<<ans<<endl;

}

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