求条

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

int n, l, r;
int w[200001];

int dp[400001];
priority_queue<pair<int, int> > p;

signed main() {
	memset(dp, 0x80, sizeof (dp));
	cin >> n >> l >> r;
	for (int i = 0; i <= n; i++) {
		cin >> w[i];
	}
	for (int i = l; i < n + r; i++) {
		p.push({w[i], i});
		while (p.top().second < i) {
			p.pop();
		}
		dp[i] = dp[i - p.top().second] + w[p.top().first];
	}
	int ans = INT_MIN;
	for (int i = n; i <= n + r; i++) {
		ans = max(ans, dp[i]);
	}
	cout << ans;
	return 0;
}