前五个WA

#include <bits/stdc++.h>
using namespace std;
const int N=5e5+10;
int a[N],s[N];
queue<int> q;
int main(){
	int n,m;
	cin>>n>>m;
	for(int i=1;i<=n;i++){
		scanf("%d",&a[i]);
		s[i]=s[i-1]+a[i];
	}
	int mx=-1e9;
	q.push(0);
	for(int i=1;i<=n;i++){
		while(q.front()+m<i) q.pop();
		mx=max(mx,s[i]-s[q.front()]);
		while(q.size()!=0&&s[q.back()]>=s[i]){
			q.pop();
		}
		q.push(i);
	}
	cout<<mx;
}