Submission #1233208
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 t = accumulate(b.begin(), b.begin()+k, 0LL);
lli s = accumulate(c.begin(), c.begin()+k, 0LL);
lli ans = min(t, s);
rep(i, n-k+1){
t = t+b[k+i]-b[i];
s = s+c[k+i]-c[i];
ans = min(ans, min(t, s));
}
cout << accumulate(b.begin(), b.end(), 0ll) - ans << endl;
return 0;
}
Submission Info
Submission Time |
|
Task |
B - Contiguous Repainting |
User |
ktyshmt |
Language |
C++14 (GCC 5.4.1) |
Score |
400 |
Code Size |
1248 Byte |
Status |
AC |
Exec Time |
49 ms |
Memory |
1408 KB |
Judge Result
Set Name |
Sample |
All |
Score / Max Score |
0 / 0 |
400 / 400 |
Status |
|
|
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 |
8 ms |
764 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 |
18 ms |
1408 KB |
1_04.txt |
AC |
45 ms |
1408 KB |
1_05.txt |
AC |
49 ms |
1408 KB |
1_06.txt |
AC |
42 ms |
1408 KB |
1_07.txt |
AC |
42 ms |
1408 KB |
1_08.txt |
AC |
43 ms |
1408 KB |
1_09.txt |
AC |
43 ms |
1408 KB |
1_10.txt |
AC |
42 ms |
1408 KB |
1_11.txt |
AC |
43 ms |
1408 KB |
1_12.txt |
AC |
43 ms |
1408 KB |
1_13.txt |
AC |
43 ms |
1408 KB |
1_14.txt |
AC |
43 ms |
1408 KB |
1_15.txt |
AC |
44 ms |
1408 KB |
1_16.txt |
AC |
43 ms |
1408 KB |
1_17.txt |
AC |
42 ms |
1408 KB |
1_18.txt |
AC |
43 ms |
1408 KB |
1_19.txt |
AC |
41 ms |
1408 KB |
1_20.txt |
AC |
43 ms |
1408 KB |
1_21.txt |
AC |
43 ms |
1408 KB |