Submission #771153

#	Time	Username	Problem	Language	Result	Execution time	Memory
771153		gagik_2007	Financial Report (JOI21_financial)	C++17	60 / 100	4067 ms	3776 KiB

Main

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

typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;

ll ttt;
const ll INF=1e18;
const ll MOD=1e9+7;
const ll N=3e5+7;
ll n,m,k;
ll a[N];
ll dp[N];
int ri[N];

void precalc() {
    
}

int main() {
    precalc();
    cin>>n>>k;
    for(int i=0;i<n;i++){
        cin>>a[i];
    }
    if(k==1){
        stack<int>st;
        ll ans=0;
        for(int i=n-1;i>=0;i--){
            while(!st.empty()&&st.top()<=a[i]){
                st.pop();
            }
            st.push(a[i]);
            ans=max(ans,(ll)st.size());
        }
        cout<<ans<<endl;
        return 0;
    }
    for(int i=0;i<n;i++){
        ri[i]=i;
        for(int j=i+1;j<min(n,ri[i]+k+1);j++){
            if(a[j]<=a[i]){
                ri[i]=j;
            }
        }
        //cout<<ri[i]<<" ";
    }
    //cout<<endl;
    ll ans=0;
    for(int i=0;i<n;i++){
        dp[i]=1;
        for(int j=0;j<i;j++){
            if(a[i]>a[j]&&ri[j]>=i-k){
                dp[i]=max(dp[i],dp[j]+1);
            }
        }
        if(ri[i]==n-1){
            ans=max(ans,dp[i]);
        }
        //cout<<dp[i]<<" ";
    }
    cout<<ans<<endl;
}

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