Submission #4046493


Source Code Expand

#include<bits/stdc++.h>

#define INF 1e9
#define llINF 1e18
#define MOD 1000000007
#define pb push_back
#define mp make_pair 
#define F first
#define S second
#define ll long long
#define ALL(a) (a).begin(),(a).end()
#define Yes(hoge) cout<<((hoge)?"Yes":"No")<<endl;
#define YES(hoge) cout<<((hoge)?"YES":"NO")<<endl;
using namespace std;
struct Grid{int x,y,t;};
struct Edge{int to,cost;};
struct Graph{vector<vector<Edge>>E;int V;
  const ll Inf = llINF;const int MAX_V=1010;vector<ll>d;
  Graph(int n):E(n){d.resize(MAX_V);E.resize(n);V=n;}
  void init(){for(int i=0;i<MAX_V;i++)d[i]=Inf;}
  void add_edge(int from,int to,int cost){E[from-1].pb({to-1,cost});}
};
int main(){
  cin.tie(0);
  ios::sync_with_stdio(false);
  ll n,k;cin>>n>>k;
  vector<ll>num(n+10);
  vector<ll>num2(n+10);
  for(int i=1;i<=n;i++){
    cin>>num[i];
    if(num[i]>0)num2[i]+=num[i];
    num[i]+=num[i-1];
    num2[i]+=num2[i-1];
  }
  ll ans=0;
  if(n==1)ans=max(0LL,num[1]);
  for(int i=0;i<=n-k;i++){
    ans=max(ans,num2[i]+max(0LL,num[i+k]-num[i])+num2[n]-num2[i+k]);
  }
  cout<<ans<<endl;
  return 0;
}

Submission Info

Submission Time
Task B - Contiguous Repainting
User shi
Language C++14 (GCC 5.4.1)
Score 400
Code Size 1134 Byte
Status AC
Exec Time 13 ms
Memory 1792 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 400 / 400
Status
AC × 4
AC × 26
Set Name Test Cases
Sample 0_00.txt, 0_01.txt, 0_02.txt, 0_03.txt
All 0_00.txt, 0_01.txt, 0_02.txt, 0_03.txt, 1_00.txt, 1_01.txt, 1_02.txt, 1_03.txt, 1_04.txt, 1_05.txt, 1_06.txt, 1_07.txt, 1_08.txt, 1_09.txt, 1_10.txt, 1_11.txt, 1_12.txt, 1_13.txt, 1_14.txt, 1_15.txt, 1_16.txt, 1_17.txt, 1_18.txt, 1_19.txt, 1_20.txt, 1_21.txt
Case Name Status Exec Time Memory
0_00.txt AC 1 ms 256 KB
0_01.txt AC 1 ms 256 KB
0_02.txt AC 1 ms 256 KB
0_03.txt AC 1 ms 256 KB
1_00.txt AC 1 ms 256 KB
1_01.txt AC 1 ms 256 KB
1_02.txt AC 1 ms 256 KB
1_03.txt AC 8 ms 1792 KB
1_04.txt AC 12 ms 1792 KB
1_05.txt AC 13 ms 1792 KB
1_06.txt AC 12 ms 1792 KB
1_07.txt AC 12 ms 1792 KB
1_08.txt AC 12 ms 1792 KB
1_09.txt AC 12 ms 1792 KB
1_10.txt AC 12 ms 1792 KB
1_11.txt AC 13 ms 1792 KB
1_12.txt AC 12 ms 1792 KB
1_13.txt AC 12 ms 1792 KB
1_14.txt AC 12 ms 1792 KB
1_15.txt AC 12 ms 1792 KB
1_16.txt AC 12 ms 1792 KB
1_17.txt AC 12 ms 1792 KB
1_18.txt AC 12 ms 1792 KB
1_19.txt AC 11 ms 1792 KB
1_20.txt AC 12 ms 1792 KB
1_21.txt AC 12 ms 1792 KB