Problem:
Score : 400 points

Problem Statement

There are N squares aligned in a row.
The i-th square from the left contains an integer a_i.

Initially, all the squares are white.
Snuke will perform the following operation some number of times:

Select K consecutive squares. Then, paint all of them white, or paint all of them black. Here, the colors of the squares are overwritten.

After Snuke finishes performing the operation, the score will be calculated as the sum of the integers contained in the black squares.
Find the maximum possible score.

Constraints

1≤N≤10^5

1≤K≤N

a_i is an integer.

|a_i|≤10^9

Input

The input is given from Standard Input in the following format:

N K
a_1 a_2 ... a_N

Output

Print the maximum possible score.

Sample Input 1

5 3
-10 10 -10 10 -10

Sample Output 1

10

Paint the following squares black: the second, third and fourth squares from the left.

Sample Input 2

4 2
10 -10 -10 10

Sample Output 2

20

One possible way to obtain the maximum score is as follows:

Paint the following squares black: the first and second squares from the left.

Paint the following squares black: the third and fourth squares from the left.

Paint the following squares white: the second and third squares from the left.

Sample Input 3

1 1
-10

Sample Output 3

0

Sample Input 4

10 5
5 -4 -5 -8 -4 7 2 -4 0 7

Sample Output 4

17

Solution in C (GCC 5.4.1) (judge verdict: Wrong Answer)

#include<stdio.h>
#include<stdlib.h>
#include<string.h>
#include<math.h>
 
#define sl(x) scanf("%ld", &x)
#define ss(x) scanf("%s", x)
#define pl(x) printf("%ld\n", x)
#define ps(x) printf("%s\n", x)
 
#define INF 100000000000
#define MOD 1000000007
 
#define MIN(a,b) (((a)<(b))?(a):(b))
#define MAX(a,b) (((a)>(b))?(a):(b))

int main() {
	long N, K;
	long a[100010];
	long sum[100010];
	long i, j;
	long tmp;
	long ans;
	long min_i, max_i;
	
	sl(N); sl(K);
	for(i=0;i<N;i++) {
		sl(a[i]);
	}
	sum[0] = 0;
	for(i=0;i<K;i++) {
		sum[0] += a[i];
	}
	min_i = max_i = 0;
	for(i=1;i<=N-K;i++) {
		sum[i] = sum[i-1] - a[i-1] + a[K+i-1];
		if(sum[min_i] > sum[i]) min_i = i;
		if(sum[max_i] < sum[i]) max_i = i;
	}
	
	tmp = 0;
	for(i=0;i<N;i++) {
		if(min_i <= i && i < min_i + K) {
			;
		} else {
			if(a[i] > 0) tmp += a[i];
		}
	}
	ans = tmp;
	tmp = 0;
	for(i=0;i<N;i++) {
		if(max_i <= i && i < max_i + K) {
			tmp += a[i];
		} else {
			if(a[i] > 0) tmp += a[i];
		}
	}
	ans = MAX(ans, tmp);
	
	pl(ans);
	
	return 0;
}