WA on #11 #12

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

struct node{
	int no,val;
}N;

int n,l,r,a[200050],dp[400050],len,ans=-2147483647;
deque<node> q;

int main()
{
	cin>>n>>l>>r;
	for(int i=0;i<=n;i++)cin>>a[i];
	len=r-l+1;
	memset(dp,-0x7f,sizeof(dp));
	dp[0]=0;
	for(int i=0;i<=n;i++){
		while(!q.empty()&&i-q.back().no>=len)q.pop_back();
		while(!q.empty()&&q.front().val<=dp[i])q.pop_front();
		N.no=i;N.val=dp[i];
		q.push_front(N);
		dp[i+l]=q.back().val+a[i+l];
	}for(int i=n+1;i<=2*n;i++)ans=max(ans,dp[i]);
	cout<<ans<<endl;
	return 0;
}