제출 #1244063

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1244063		m5588ohammed	Financial Report (JOI21_financial)	C++20	48 / 100	4093 ms	8400 KiB

Main

#include <bits/stdc++.h>
#define endl "\n"
#define mod 1000000007
#define int long long
using namespace std;
int n,d,arr[300010];
int bigL[300010],bigR[300010],dp[300010];
void stack_trick(){
    vector <int> qu;
    for(int i=1;i<=n;i++){
        while(!qu.empty()&&arr[qu.back()]<=arr[i]){ qu.pop_back();}
        if(qu.size()==0) bigL[i]=0;
        else bigL[i]=qu.back();
        qu.push_back(i);
    }
    qu.clear();
    for(int i=n;i>=1;i--){
        while(!qu.empty()&&arr[qu.back()]<=arr[i]){ qu.pop_back();}
        if(qu.size()==0) bigR[i]=n+1;
        else bigR[i]=qu.back();
        qu.push_back(i);
    }
    qu.clear();
}
signed main(){
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);
    cin>>n>>d;
    for(int i=1;i<=n;i++) cin>>arr[i];
    stack_trick();
    int ans=0;
    for(int i=1;i<=n;i++){
        dp[i]=1;
        int cnt=0;
        for(int j=i-1;j>=1;j--){
            if(arr[j]>arr[i]){
                cnt++;
                if(cnt+1>d) break;
            }
            else cnt=0;
            if(arr[i]<=arr[j]) continue;
            dp[i]=max(dp[i],dp[j]+1);
        }
        //cout<<i<<" "<<dp[i]<<endl;
        ans=max(ans,dp[i]);
    }
    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