Submission #1041798

---

Source Code Expand

// Template {{{
#include <bits/stdc++.h>
#define REP(i,n) for(int i=0; i<(int)(n); ++i)
using namespace std;
typedef long long LL;

#ifdef LOCAL
#include "contest.h"
#else
#define dump(x) 
#endif

const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
inline bool valid(int x, int w) { return 0 <= x && x < w; }

void iostream_init() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.setf(ios::fixed);
    cout.precision(12);
}
//}}}

int main(){
    iostream_init();
        int N, K;
    while(cin >> N >> K) {

        vector<LL> A(N);
        REP(i, N) cin >> A[i];

        vector<LL> sum(N + 1);
        REP(i, N) sum[i+1] = sum[i] + A[i];

        vector<LL> sumL(N+1);
        vector<LL> sumR(N+1);

        REP(i, N) {
            sumL[i+1] = sumL[i] + max(0LL, A[i]);
            sumR[N-1-i] = sumR[N-i] + max(0LL, A[N-1-i]);
        }

        LL ans = 0;
        REP(i, N - K + 1) {
            int l = i;
            int r = i + K;
            ans = max(ans, sumL[l] + sumR[r] + max(sum[r] - sum[l], 0LL));
        }
        cout << ans << endl;
    }

    return 0;
}

Submission Info

Judge Result