Submission #1233151

---

Source Code Expand

#include<cstdio>
#include<cstring>
#include<vector>
#include<queue>
#include<algorithm>
#include<cmath>
#include<climits>
#include<string>
#include<numeric>
#include<set>
#include<map>
#include<iostream>
using namespace std;
#define rep(i,n) for(int i = 0;i<((int)(n));i++)
#define reg(i,a,b) for(lli i = ((int)(a));i<=((int)(b));i++)
#define irep(i,n) for(int i = ((int)(n)-1);i>=0;i--)
#define ireg(i,a,b) for(int i = ((int)(b)-1);i>=((int)(a));i--)
typedef long long int lli;
typedef pair<int, int> mp;
#define fir first
#define sec second
#define IINF INT_MAX
#define LINF LLONG_MAX
#define eprintf(...) fprintf(stderr,__VA_ARGS__)
#define pque(type) priority_queue<type,vector<type>,greater<type> >
#define memst(a,b) memset(a,b,sizeof(a))
 
int main(void){
	int n, k; cin >> n >> k;
	vector<int> a(n), b(n, 0), c(n, 0);
	rep(i, n){
		cin >> a[i];
		if(a[i] > 0) b[i] = a[i];
		else c[i] = -a[i];
	}

	lli sum = accumulate(b.begin(), b.end(), 0ll), ans = LINF;
	
	rep(i, n-k+1){
		lli t = accumulate(b.begin()+i, b.begin()+i+k, 0LL);
		lli s = accumulate(c.begin()+i, c.begin()+i+k, 0LL);
		ans = min(ans, min(t, s));
	}
	
	cout << sum - ans << endl;
	
	return 0;
}

Submission Info

Judge Result