Submission #4031419

---

Source Code Expand

#include <iostream>
#include <algorithm>
#include <vector>
#include <queue>
#include <stack>
#include <string>
#include <iomanip>
using namespace std;
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
#define FOR(i,m,n) for(int (i)=(m);(i)<(n);(i)++)
typedef long long ll;
const int dx[4]={1,0,-1,0};
const int dy[4]={0,1,0,-1};

int main(){
    int n,k;
    cin >> n >> k;
    vector<ll> a(n);
    rep(i,n){
        cin >> a[i];
    }
    vector<ll> sum(n,a[0]),best_sum(n,max(0LL,a[0]));
    for(int i=1;i<n;i++){
        sum[i]=sum[i-1]+a[i];
        best_sum[i]=best_sum[i-1]+max(0LL,a[i]);
    }
    ll ans = -1;
    for(int i=0;i+k<=n;i++){
        ll tmp=0LL;
        if(i==0){
            tmp = max(0LL,sum[k-1])+best_sum[n-1]-best_sum[k-1];
        }else{
            tmp = max(0LL,sum[i+k-1]-sum[i-1])+best_sum[n-1]-(best_sum[i+k-1]-best_sum[i-1]);
        }
        ans = max(ans,tmp);
    }
    cout << ans << endl;
    return 0;
}

Submission Info

Judge Result