Submission #1308336

---

Source Code Expand

#include <iostream>
#include <vector>
#include <cstdio>
using namespace std;

typedef long long int ll;
typedef unsigned long long int ull;

int main(void) {
  int N, K;
  cin >> N >> K;

  vector<ll> a(N), accum(N), paccum(N, 0);
  for(int i = 0; i < N; i++) {
    cin >> a[i];
    if (i == 0) {
      accum[0] = a[0];
      if (a[0] > 0)
        paccum[0] = a[0];
    } else {
      accum[i] = a[i] + accum[i-1];
      if (a[i] > 0)
        paccum[i] = a[i] + paccum[i-1];
      else
        paccum[i] = paccum[i-1];
    }
  }

  ll ans = 0;
  for (int i = 0; i <= N - K; i++) {
    ll mid = accum[i+K-1];
    if (i > 0)
      mid -= accum[i-1];

    ll left = 0, right = 0;
    if (i > 0)
      left = paccum[i-1];

    if (i + K < N)
      right = paccum[N-1] - paccum[i+K-1];

    ans = max(ans, mid + left + right);
    ans = max(ans, left + right);
  }

  cout << ans << endl;
  return 0;
}

Submission Info

Judge Result