单调队列，WA sub2求救

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

const int si=2e5+10;
int n,l,r;
int a[si];
int f[si];
int q[si],head=1,tail=0;

int main(){
	scanf("%d%d%d",&n,&l,&r);
	if(l>r) swap(l,r);
	for(register int i=0;i<=n;++i){
		scanf("%d",&a[i]);
	}
	int ans=f[0]=0;
	for(register int i=l;i<=n;++i){
		while(head<=tail && q[head]<=(i-r-1)) head++;
		while(head<=tail && f[q[tail]]<f[i-l]) tail--;
		q[++tail]=i-l;
		f[i]=f[q[head]]+a[i];
		if(i+r>n) ans=max(f[i],ans);
	}
	printf("%d",ans);
	return 0;
}