제출 #661570

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
661570		victor_gao	Financial Report (JOI21_financial)	C++17	0 / 100	4026 ms	7860 KiB

Main

//#pragma GCC optimize("Ofast,unroll-loops,O3")
//#pragma GCC optimize("avx,avx2,sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,fma,tune=native")
#include<bits/stdc++.h>
//#include<bits/extc++.h>
//#pragma pack(1)
#define fast ios::sync_with_stdio(0); cin.tie(0);
#define int long long
#define pii pair<int,int>
#define x first
#define y second
#define N 300015
using namespace std;
//using namespace __gnu_pbds;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
//typedef tree<int, null_type,less_equal<int>, rb_tree_tag,tree_order_statistics_node_update> order_multiset;
//typedef tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update> order_set;
int dp[N],n,d,a[N];
signed main(){
    fast
    cin>>n>>d;
    for (int i=1;i<=n;i++)
        cin>>a[i];
    a[0]=-1;
    int mx=0;
    for (int i=1;i<=n;i++){
        for (int j=max(i-d,1LL);j<i;j++){
            if (a[i]>a[j]) dp[i]=max(dp[j]+1,dp[i]);
        }
        dp[i]=max(dp[i],1LL);
        mx=max(mx,dp[i]);
    }
    cout<<mx<<'\n';
}

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