제출 #488123

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

Main

#include<bits/stdc++.h>
using namespace std;
#define mp make_pair
#define INF 10000000
#define MOD 1000000007
#define MID ((l+r)/2)
#define HASHMOD 2305843009213693951
#define ll long long
#define ull unsigned long long
#define F first
#define S second
typedef pair<ll, ll> ii;
typedef pair<ii, int> iii;
typedef vector<int> vi;
typedef vector<ii> vii;
typedef map<int, int> mii;

#define EPS 1e-6
#define FOR(i,n) for(int i=0;i<((int)(n));i++)
#define FORi(i,a,b) for(int i=((int)(a));i<((int)(b));i++)
#define FOA(v, a) for(auto v : a)

vi a, b;
int n, k;
map<int, int> m;

int dp[5000][5000];
int maxx[5000];

int rec(int x, int px){
	int ans=0;
	if(maxx[x]<px) return 0;
	if(maxx[x] == px && dp[x][px]!=-1) return dp[x][px];
	FOR(i,k){
		int c=0;
		if(x+i+1>=n) break;
		if(a[x+i+1]>px) c++;
		ans = max(ans, c + rec(x+i+1, max(px, a[x+i+1])));
	}
	dp[x][px] = ans;
	maxx[x] = min(maxx[x], px);
	//cout<<x<<" "<<px<<" "<<ans<<endl;
	return ans;
}

int main(){
	ios::sync_with_stdio(false);
	cin.tie(0);
	cin>>n>>k;
	FOR(i,n+1) maxx[i] = MOD;
	FOR(i,n) FOR(j,n) dp[i][j] = -1;
	a.resize(n);
	FOR(i,n) cin>>a[i];
	int cnt=0;
	set<int> all;
	FOR(i,n) all.insert(a[i]);
	FOA(v, all) m[v] = ++cnt;
	FOR(i,n) a[i] = m[a[i]];
	//FOR(i,n) cout<<a[i]<<" ";
	//cout<<endl;
	int maxa = 0;
	FOR(i,n) maxa = max(maxa, rec(i, a[i])+1);
	cout<<maxa<<endl;


}

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