Submission #1698218

---

Source Code Expand

#include "bits/stdc++.h"
#define rep(i,n) for(int i=0;i<n;i++)
#define ALL(v) (v).begin(),(v).end()
typedef long long LL;
const int INF = 1 << 25;
const LL MOD = 1000000007LL;
using namespace std;
typedef pair<int, int> P;
LL sum1[100001], sum2[100001];
int main() {
	int N, K;
	cin >> N >> K;
	for (int i = 1; i <= N; i++) {
		int a;
		cin >> a;
		sum1[i] = sum1[i - 1] + a;
		sum2[i] = sum2[i - 1] + max(a, 0);
	}
	LL ans = 0;
	for (int i = 1; i + K - 1 <= N; i++) {
		ans = max(ans, sum2[i - 1] + max(sum1[i + K - 1] - sum1[i - 1], 0LL) + sum2[N] - sum2[i + K - 1]);
	}
	cout << ans << endl;
}

Submission Info

Judge Result