제출 #727171

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
727171		NeroZein	Financial Report (JOI21_financial)	C++17	14 / 100	85 ms	194624 KiB

Main

#include "bits/stdc++.h"
using namespace std;

#ifdef Nero
#include "Deb.h"
#else
#define deb(...)
#endif

const int N = 7005;

int a[N];
int la[N][N];

int n, d;
int dp[N][N]; 
int bt (int id, int mx) {
	if (id == n) return 0; 
	int& ret = dp[id][mx];
	if (ret != -1) {
		return ret;
	}
	if (a[id] <= mx) {
		return ret = bt(id + 1, mx); 
	}
	if (id - la[mx][id] > d) {
		return 0; 
	} 
	ret = max(bt(id + 1, mx), bt(id + 1, a[id]) + 1);
	return ret;
}

signed main(){
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	cin >> n >> d;
	vector<int> b(n);
	for (int i = 0; i < n; ++i) {
		cin >> a[i];
		b[i] = a[i];
	}
	sort(b.begin(), b.end());
	b.resize(unique(b.begin(), b.end()) - b.begin());
	for (int i = 0; i < n; ++i) {
		a[i] = lower_bound(b.begin(), b.end(), a[i]) - b.begin() + 1; 
	}
	for (int i = 0; i < n; ++i) { 
		la[0][i] = i; 
		for (int j = 1; j <= n; ++j) {
			if (j >= a[i]) {
				la[j][i] = i; 
			} else {
				la[j][i] = (i ? la[j][i - 1] : 0); 
			}
		}
	}
	memset(dp, -1, sizeof dp);
	cout << bt(0, 0) << '\n';
	return 0;
}

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