Submission #1044599

---

Source Code Expand

#include <algorithm>
#include <bitset>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <memory>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>

// c++11
#include <array>
#include <tuple>
#include <unordered_map>
#include <unordered_set>

#define mp make_pair
#define mt make_tuple
#define rep(i, n) for (int i = 0; i < (n); i++)

using namespace std;

using ll = long long;
using ull = unsigned long long;
using pii = pair<int, int>;

const int INF = 1 << 29;
const double EPS = 1e-9;
const ll MOD = 1000000007;

const int dx[] = {1, 0, -1, 0}, dy[] = {0, -1, 0, 1};
const int MAX_N = (int)1e5 + 10;
int N,K;
vector<int> A;
vector<ll> sum,val;
int main() {
  cin >> N >> K;
  A.resize(N);
  sum.resize(N);
  val.resize(N);
  for (auto &val : A){
    cin >> val;
  }
  sum[0] = A[0];
  val[0] = max(0LL, (ll)A[0]);
  for (int i = 1; i < N; i++){
    sum[i] += sum[i - 1] + A[i];
    val[i] += val[i - 1] + max(0, A[i]);
  }
  ll res = 0;
  for (int i = 0; i < N; i++){
    if (i + K - 1 < N){
      ll cost = sum[i + K - 1];
      if (i - 1 >= 0){
        cost -= sum[i - 1];
      }
      //black
      ll left,right;
      left = right = 0;
      if (i - 1 >= 0){
        left = val[i - 1];
      }
      right = val[N - 1];
      right -= val[i + K - 1];
      res = max(res, cost + left + right);
      res = max(res, left + right);
    }
  }
  cout << res << endl;
  return 0;
}

Submission Info

Judge Result