제출 #423073

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

Main

#include<bits/stdc++.h>
#include<unordered_map>
#define rep(i,a,b) for(int i=int(a);i<int(b);i++)
#define rrep(i,a,b) for(int i=int(a);i>int(b);i--)
#define trav(a,v) for(auto& a: v)
#define sz(v) v.size()
#define all(v) v.begin(),v.end()
#define vi vector<int>

typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
const long long inf = 1e15;

using namespace std;
int main() {
	cin.sync_with_stdio(false);
	int n,d;
	cin >> n >> d;
	vector<pair<ll, int>> v(n);
	rep(i, 0, n) {
		cin >> v[i].first;
		v[i].second = -i;
	}
	sort(all(v));
	vector<ll> dp(n,-inf);
	rep(i, 0, n) {
		dp[-v[i].second] = 1;
		rrep(j, -v[i].second - 1, max(-1, -v[i].second - 1 - d)) {
			dp[-v[i].second] = max(dp[-v[i].second], dp[j] + 1);
		}
	}
	ll ans = 1;
	trav(a, dp)ans = max(ans, a);
	cout << ans << endl;
	return 0;
}

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