제출 #975275

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
975275		LCJLY	Financial Report (JOI21_financial)	C++14	48 / 100	77 ms	604 KiB

Main

#include <bits/stdc++.h>
using namespace std;
 
#define int long long 
#define ld long double
#define show(x,y) cout << y << " " << #x << endl;
#define show2(x,y,i,j) cout << y << " " << #x << "  " << j << " " << #i << endl;
#define show3(x,y,i,j,p,q) cout << y << " " << #x << "  " << j << " " << #i << "  " << q << " " << #p << endl;
#define show4(x,y) for(auto it:y) cout << it << " "; cout << #x << endl;
typedef pair<long long,long long>pii;
typedef pair<int,pii>pi2;
mt19937_64 rng(chrono::system_clock::now().time_since_epoch().count());
 
int arr[7005];
int n,k;
 
void solve(){
	cin >> n >> k;
	for(int x=1;x<=n;x++){
		cin >> arr[x];
	}
	
	int dp[n+5];
	memset(dp,0,sizeof(dp));
	int best=0;
	for(int x=n;x>=1;x--){
		dp[x]=max(dp[x],1LL);
		int left=k;
		for(int y=x+1;y<=n;y++){
			if(left==0) break;
			if(arr[y]>arr[x]){
				dp[x]=max(dp[x],dp[y]+1);
			}
			else if(arr[y]==arr[x]){
				//dp[x]=max(dp[x],dp[y]);
				left=k+1;
			}
			else if(arr[y]<arr[x]){
				left=k+1;
			}
			left--;
		}
		//show(dp[x],dp[x]);
		best=max(best,dp[x]);
	}
	cout << best;
}
 
int32_t main(){
	ios::sync_with_stdio(0);
	cin.tie(0);
	int t=1;
	//freopen("in.txt","r",stdin);
	//cin >> t;
	while(t--){
		solve();
	}
}

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