Submission #66355432

---

Source Code Expand

#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;

#define rep(i, n) for(int i =0; i < (n); i++)
using ll = long long int;
int n, d, r;
vector<int> h;
//int ans;
vector<int> memo;
int dfs(int current) {
	if (memo[current] != -1) return memo[current];
	int best = 0;
	for (int i = -r; i <= r; i++) {
		if (i == 0) continue;
		int next = current + i;
		if (next < 0 or next >= n) continue;

		if (h[next] <= h[current]-d) {
			int cnt = dfs(next) + 1;
			best = max(best, cnt);
		}
	}
	return memo[current] = best;
}
int main() {
	ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
	//freopen("input.txt", "r", stdin);
	cin >> n >> d >> r;
	h.resize(n);
	memo.assign(n, -1);

	rep(i, n) cin >> h[i];
	
	int ans = 0;
	for (int i = 0; i < n; i++) {
		int cnt = dfs(i);
		ans = max(ans, cnt);
	}
	cout << ans << endl;
	
	return 0;  
}  

Submission Info

Judge Result