Submission #1691518

---

Source Code Expand

#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <functional>
#include <numeric>
#include <stack>
#include <queue>
#include <map>
#include <set>
#include <utility>
#include <sstream>
#include <complex>
#include <fstream>
#include <bitset>
#include <time.h>
#include <tuple>

using namespace std;

typedef long long ll;
typedef pair<ll, ll> P;
typedef vector<ll> V;
typedef complex<double> Point;

#define PI acos(-1.0)
#define EPS 1e-10
const ll INF = 1e12;
const ll MOD = 1e9 + 7;

#define FOR(i,a,b) for(int i=(a);i<(b);i++)
#define rep(i,N) for(int i=0;i<(N);i++)
#define ALL(s) (s).begin(),(s).end()
#define EQ(a,b) (abs((a)-(b))<EPS)
#define EQV(a,b) ( EQ((a).real(), (b).real()) && EQ((a).imag(), (b).imag()) )
#define fi first
#define se second
#define N_SIZE (1LL << 20)
#define NIL -1
#define MAX_N 100100 * 3

int n, k;
ll a[100100];
ll sum[100100];
ll sum2[100100];

int main() {
	cin >> n >> k;
	rep(i, n)cin >> a[i];
	rep(i, n) {
		if (i != 0) {
			sum[i] = sum[i - 1] + a[i];
			sum2[i] = sum2[i - 1] + max((ll)0, a[i]);
		}
		else {
			sum[i] = a[i];
			sum2[i] = max((ll)0, a[i]);
		}
	}
	ll ans = -1e15;
	rep(i, n - k + 1) {
		ll num;
		if (i > 0) {
			num = max((ll)0, sum[k - 1 + i] - sum[i - 1])
				+ sum2[n - 1] - sum2[k - 1 + i] + sum2[i - 1];
		}
		else {
			num = max((ll)0, sum[k - 1 + i])
				+ sum2[n - 1] - sum2[k - 1 + i];
		}
		//cout << i << " " << num << endl;
		ans = max(ans, num);
	}
	cout << ans << endl;
}

Submission Info

Judge Result