Submission #1042551
Source Code Expand
#include<iostream>
#include<algorithm>
#include<climits>
#include<cmath>
#include<cstdio>
#include<cstdlib>
#include<ctime>
#include<string>
#include<cstring>
#include<vector>
#include<stack>
#include<queue>
#include<set>
#include<map>
#include<bitset>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> i_i;
typedef pair<long long, int> ll_i;
#define PI 3.141592653589793238462643383279
#define mod 1000000007LL
#define rep(i, n) for(i = 0;i < n;++i)
#define rep1(i, n) for(i = 1;i < n;++i)
#define per(i, n) for(i = n - 1;i > -1;--i)
#define int(x) int x; scanf("%d",&x)
#define int2(x, y) int x, y; scanf("%d%d",&x, &y)
#define int3(x, y, z) int x, y, z; scanf("%d%d%d",&x, &y, &z)
#define int4(v, x, y, z) int v, x, y, z; scanf("%d%d%d%d", &v, &x, &y, &z)
#define int5(v, w, x, y, z) int v, w, x, y, z; scanf("%d%d%d%d%d", &v, &w, &x, &y, &z)
#define pri(x) cout << (x) << "\n"
#define pri2(x, y) cout << (x) << " " << (y) << "\n"
#define pri3(x, y, z) cout << (x) << " " << (y) << " " << (z) << "\n"
#define pb push_back
#define mp make_pair
#define all(a) (a).begin(),(a).end()
#define kabe puts("---------------------------")
#define kara puts("")
#define debug(x) cout << " --- " << (x) << "\n"
#define debug2(x, y) cout << " --- " << (x) << " " << (y) << "\n"
#define debug3(x, y, z) cout << " --- " << (x) << " " << (y) << " " << (z) << "\n"
#define X first
#define Y second
#define eps 0.0001
#define prid(x) printf("%.15lf\n", x)
ll a[100000];
signed main(void){
int i, j;
for(int testcase = 0;testcase >= 0;testcase++){
int2(n, k);
rep(i, n)scanf("%lld", a + i);
ll tmp = 0;
rep(i, n)if(a[i] >= 0)tmp += a[i];
ll sum1 = 0LL, sum2 = 0LL;
rep(i, k){
sum1 += a[i];
if(a[i] >= 0)sum2 += a[i];
}
ll res = 0;
res = max(res, tmp - sum2 + sum1);
res = max(res, tmp - sum2);
i = 0;
//pri(tmp);
//debug2(i, res);
//debug2(sum1, sum2);
for(i = 0;i < n - k;++i){
sum1 += a[i + k] - a[i];
if(a[i] >= 0)sum2 -= a[i];
if(a[i + k] >= 0)sum2 += a[i + k];
res = max(res, tmp - sum2 + sum1);
res = max(res, tmp - sum2);
//debug2(i + 1, res);
//debug2(sum1, sum2);
}
pri(res);
/*/
//*/ break;
}
return 0;
}
Submission Info
Submission Time
2016-12-25 21:41:11+0900
Task
B - Contiguous Repainting
User
themoai34
Language
C++14 (GCC 5.4.1)
Score
400
Code Size
2375 Byte
Status
AC
Exec Time
16 ms
Memory
1024 KB
Compile Error
./Main.cpp: In function ‘int main()’:
./Main.cpp:54:15: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
int2(n, k);
^
./Main.cpp:55:34: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
rep(i, n)scanf("%lld", a + i);
^
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
2 ms
256 KB
0_01.txt
AC
2 ms
256 KB
0_02.txt
AC
2 ms
256 KB
0_03.txt
AC
2 ms
256 KB
1_00.txt
AC
3 ms
256 KB
1_01.txt
AC
3 ms
256 KB
1_02.txt
AC
3 ms
256 KB
1_03.txt
AC
11 ms
1024 KB
1_04.txt
AC
15 ms
1024 KB
1_05.txt
AC
16 ms
1024 KB
1_06.txt
AC
15 ms
1024 KB
1_07.txt
AC
15 ms
1024 KB
1_08.txt
AC
15 ms
1024 KB
1_09.txt
AC
15 ms
1024 KB
1_10.txt
AC
15 ms
1024 KB
1_11.txt
AC
15 ms
1024 KB
1_12.txt
AC
14 ms
1024 KB
1_13.txt
AC
15 ms
1024 KB
1_14.txt
AC
15 ms
1024 KB
1_15.txt
AC
15 ms
1024 KB
1_16.txt
AC
15 ms
1024 KB
1_17.txt
AC
15 ms
1024 KB
1_18.txt
AC
15 ms
1024 KB
1_19.txt
AC
15 ms
1024 KB
1_20.txt
AC
15 ms
1024 KB
1_21.txt
AC
15 ms
1024 KB