Submission #1484561

---

Source Code Expand

#include <bits/stdc++.h>
#include <cstdio>
#include <cstdlib>
 
#ifdef _MSC_VER
#include <Windows.h>
#else
#include <unistd.h>
#endif
 
using namespace std;
 
//conversion
//------------------------------------------
inline int toInt(string s) {int v; istringstream sin(s);sin>>v;return v;}
template<class T> inline string toString(T x) {ostringstream sout;sout<<x;return sout.str();}
 
//math
//-------------------------------------------
template<class T> inline T sqr(T x) {return x*x;}
 
//typedef
//------------------------------------------
typedef pair<int, int> PII;
typedef pair<long, long> PLL;
typedef long long LL;
//container util
//------------------------------------------
#define ALL(a)  (a).begin(),(a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define PB emplace_back
#define MP make_pair
#define SZ(a) int((a).size())
#define SORT(c) sort((c).begin(),(c).end())
 
//repetition
//------------------------------------------
#define FOR(i,a,b) for(LL i=(a);i<(b);++i)
#define REP(i,n)  FOR(i,0,n)
 
//constant
//--------------------------------------------
const double EPS = 1e-10;
const double PI  = acos(-1.0);
const LL MOD=(LL)1e9+7;
//clear memory
#define CLR(a) memset((a), 0 ,sizeof(a))
 
#define INF 1LL << 50
 

int main(){
    LL N,K;
    cin>>N>>K;
    vector<LL>a(N),b(N+1),c(N+1);
    REP(i,N)cin>>a[i];
    b[0]=0;
    c[0]=0;
    REP(i,N){
        b[i+1]=b[i]+a[i];
        c[i+1]=c[i]+max(a[i],0LL);
    }
    LL res=0;
    REP(i,N-K+1){
        LL tmp1=max(b[i+K]-b[i],0LL);
        LL tmp2=c[i]+(c[N]-c[i+K]);
        //cout<<i<<" "<<tmp1<<" "<<tmp2<<endl;
        res=max(res,tmp1+tmp2);
    }
    cout<<res<<endl;
    return 0;
}

Submission Info

Judge Result