제출 #502767

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
502767		beksultan04	Financial Report (JOI21_financial)	C++14	28 / 100	136 ms	11984 KiB

Main

#include <bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
//#define int long long
#define pii pair<int,int>
#define ret return
#define fr first
#define sc second
#define OK puts("OK");
#define NO puts("NO");
#define YES puts("YES");
#define all(s) s.begin(),s.end()
#define allr(s) s.rbegin(),s.rend()
#define nosol puts("-1");
#define pb push_back
#define endi puts("");
#define ordered_set tree <int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update>
const int N = 3e5+12,INF = 1e9+7;
int a[N],dp[1000][1000];
int main(){
	int i,n,d,j,ans=0;
	cin>>n>>d;
	vector <int> v;
	set <int> s{-1};
	map <int,int> mp;
	for (i=1;i<=n;++i){
		cin>>a[i];
		s.insert(a[i]);
	}
	int cnt = 0;
	for (auto x:s)
		mp[x] = cnt++;
	for (i=1;i<=n;++i)
		a[i] = mp[a[i]];
	
	for (i=1;i<=n;++i){
		for (j=0;j<cnt;++j){
			for (int l = max(i-d,0);l < i;++l){
				dp[i][max(a[i],j)] = max(dp[i][max(a[i],j)],dp[l][j] + (a[i] > j));
			}
		}
	}
	for (i=1;i<=n;++i)
		for (j=0;j<cnt;++j)
			ans = max(ans,dp[i][j]);
	
	cout <<ans;
	
	
	
}
 

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