Submission #528702

#	Time	Username	Problem	Language	Result	Execution time	Memory
528702		d2k05	Financial Report (JOI21_financial)	C++14	48 / 100	4083 ms	5836 KiB

Main

#include <bits/stdc++.h>

#define fastio ios_base :: sync_with_stdio(0), cin.tie(0);

using namespace std;
using ll = long long;

const int mxN = 1e6 + 5, mod = 1e9 + 7;

int n, d, a[mxN], dp[mxN];

int main() {
	fastio;
	cin >> n >> d;
	for (int i = 1; i <= n; ++i) 
		cin >> a[i], dp[i] = 1;
	int ans = 0;
	for (int i = 1; i <= n; ++i) {
		int l = i;
		for (int j = i + 1; j <= n; ++j) {
			if (a[j] <= a[i] && j - l <= d) 
				l = j;
			if (a[j] > a[i] && j - l <= d)
				dp[j] = max(dp[j], dp[i] + 1);
		 }
		if (n - l <= d)
			ans = max(ans, dp[i]);
	}
	cout << ans;
	return 0;
}

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