样例没过但AC了

#include<bits/stdc++.h>
using namespace std;
const int N=2e5+5;
int n,l,r,ans=INT_MIN;
int a[N],dp[N];
struct node
{
	int id,d;
	bool operator<(const node &o)const
	{
		return d<o.d;	
	}
};
priority_queue<node>q;
signed main()
{
	cin>>n>>l>>r;
	memset(dp,128,sizeof dp);dp[0]=0;
    for(int i=0;i<=n;i++)cin>>a[i];
    for(int i=l;i<=n;i++)
	{
        q.push({i-l,dp[i-l]});
        while(!q.empty()&&q.top().id<i-r+1)q.pop();
        dp[i]=q.top().d+a[i];         
		if(i>=n-r+1) ans=max(ans,dp[i]);
    }
    cout<<ans;
}