Submission #1574852

---

Source Code Expand

#define _CRT_SECURE_NO_WARNINGS
#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<string>
#include<algorithm>
#include<cmath>
#include<queue>
#include<vector>
#include<stack>
using namespace std;

#define int long long
#define REP(i,n) for(int i=0;(i)<(n);(i)++)
#define ll long long

static const long long INFTY = 1234567891011121314;

int a[100005];
int acc[1000005];//累積和
int sum[100005];//正の数だけ拾った累積和

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

	REP(i, N) {
		cin >> a[i];
	}

	
	REP(i, N) {
		if (i == 0) {
			acc[i] = a[i];
			continue;
		}
		acc[i] = acc[i - 1] + a[i];
	}

	
	REP(i, N) {
		if (i == 0) {
			if (a[i] > 0)sum[i] = a[i];
			else sum[i] = 0;
			continue;
		}
		if (a[i] > 0)sum[i] = sum[i - 1] + a[i];
		else sum[i] = sum[i - 1];
	}

	int ans = 0;
	int temp = 0;
	for (int i = 0;i <= N - K;i++) {
		if (i == 0) {
			ans = max(ans, (max(acc[i + K - 1], 0LL) + sum[N - 1] - sum[i + K - 1]));
		}
		else {
			ans = max(ans, (sum[i - 1] + max((acc[i + K - 1] - acc[i - 1]), 0LL) + sum[N - 1] - sum[i + K - 1]));
		}
	}

	/*
	REP(i, N) {
		cout << acc[i] << " ";
	}
	cout << endl;
	REP(i, N) {
		cout << sum[i] << " ";
	}
	cout << endl;
	*/

	cout << ans << endl;

	return 0;
}

Submission Info

Judge Result