Submission #1225691

---

Source Code Expand

#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
typedef long long lli;
lli n,k;
vector<lli> a;
lli ans = 0;
int main(){
    cin >> n >> k;
    a = vector<lli> (n);
    for(lli i = 0;i < n;i++) cin >> a[i];
    lli t = 0,s;
    for(lli i = 0;i < n;i++){
        if(a[i] > 0) t += a[i];
    }
    s = t;
    for(lli i = 0;i < k;i++){
        if(a[i] > 0) t -= a[i];
        else s += a[i];
    }
    ans = max(ans,s);
    ans = max(ans,t);
    for(lli i = k,j = 0;i < n;i++,j++){
        if(a[j] > 0) t += a[j];
        else s -= a[j];
        if(a[i] > 0) t -= a[i];
        else s += a[i];
        ans = max(ans,s);
        ans = max(ans,t);        
    }
    cout << ans << endl;
    return 0;
}

Submission Info

Judge Result