Submission #1304804

#	Time	Username	Problem	Language	Result	Execution time	Memory
1304804		dbekarys	Financial Report (JOI21_financial)	C++20	0 / 100	4091 ms	4560 KiB

Main

#include <bits/stdc++.h>
#define int long long
#define pll pair<int,int>
#define endl '\n'
using namespace std;
const int MOD2=998244353;
const int MOD1=1e9+7;
const int N=3e5+7;
const int LOG=20;
const long long inf=8e18+7;
int dp[N],mx[N],p[N];
signed main()
{
    ios_base::sync_with_stdio(0),
    cin.tie(0);
    int n,d;
    cin>> n>>d;
    int a[n];
    for(int i=0;i<n;i++){
        cin>> a[i];
    }
    if(d==1){
        exit(0);
    }
    for(int i=0;i<n;i++){
        dp[i]=1;
        p[i]=-1;
        for(int j=max(0ll,i-d);j<i;j++){
            if(dp[i]<dp[j]+(a[i]>a[j])){
                p[i]=j;
            }
            dp[i]=max(dp[i],dp[j]+(a[i]>a[j]));
        }
    }
    int c=n-1;
    vector<int>v;
    while(c!=-1){
        v.push_back(c);
        c=p[c];
    }
    reverse(v.begin() , v.end());
    cout<< dp[n-1];
}

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