Submission #4036579

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define P pair<ll,ll>
#define FOR(I,A,B) for(int I = int(A); I < int(B); ++I)
#define FORR(I,A,B) for(int I = int((B)-1); I >= int(A); --I)
#define TO(x,t,f) ((x)?(t):(f))
#define SORT(x) (sort(x.begin(),x.end())) // 0 2 2 3 4 5 8 9
#define POSL(x,v) (lower_bound(x.begin(),x.end(),v)-x.begin()) //ai>=v  x is sorted
#define POSU(x,v) (upper_bound(x.begin(),x.end(),v)-x.begin()) //ai>v  x is sorted
#define NUM(x,v) (POSU(x,v)-POSL(x,v))  //x is sorted
#define REV(x) (reverse(x.begin(),x.end())) //reverse
ll gcd(ll a,ll b){if(a<b)swap(a,b);if(a%b==0)return b;return gcd(b,a%b);}
ll lcm(ll a,ll b){ll c=gcd(a,b);return ((a/c)*(b/c)*c);}//saisyo kobaisu
#define NEXTP(x) next_permutation(x.begin(),x.end())
const ll INF=1e18+7;
const ll MOD=1e9+7;
#define pri(a) cout << (a) << endl


int main(){
	ios::sync_with_stdio(false);
	cin.tie(0);
	
	ll N , K;
	cin >> N >> K;
	vector<ll> a(N+1,0),s(N+1,0),allb(N+1,0);
	FOR(i,1,N+1){
		cin >> a[i];
		s[i] = s[i-1] + max(a[i],0ll);
		allb[i] = allb[i-1] + a[i];
	}
	ll ans = -INF;
	FOR(i,1,N-K+2){
		ans = max(ans,s[N]-s[i+K-1]+s[i-1]+max(0ll,allb[i+K-1]-allb[i-1]));
	}
	cout << ans << endl;
}

Submission Info

Judge Result