Wa #3

代码

#include <bits/stdc++.h>
using namespace std;
#define WA AC
int n, m, a[500005], sum[500005], ans = -0x3f3f3f3f;
deque<int> q;
int main(){
   scanf("%d%d", &n, &m);
   for(int i = 1; i <= n; i++){
   	scanf("%d", a + i);
   	sum[i] = sum[i - 1] + a[i];
   }
   for(int i = 1; i <= n; i++){
   	while(!q.empty() && (a[q.front()] < 0 || q.size() >= m || sum[q.back()] - sum[q.front() - 1] <= 0))q.pop_front();
   	q.push_back(i);
   	ans = max(ans, sum[i] - sum[q.front() - 1]);
   }
   printf("%d", ans);
   return 0;
}