Submission #1041208


Source Code Expand

#include "bits/stdc++.h"
using namespace std;
#define rep(i,n) for(int (i)=0;(i)<(int)(n);++(i))
#define rer(i,l,u) for(int (i)=(int)(l);(i)<=(int)(u);++(i))
#define reu(i,l,u) for(int (i)=(int)(l);(i)<(int)(u);++(i))
static const int INF = 0x3f3f3f3f; static const long long INFL = 0x3f3f3f3f3f3f3f3fLL;
typedef vector<int> vi; typedef pair<int, int> pii; typedef vector<pair<int, int> > vpii; typedef long long ll;
template<typename T, typename U> static void amin(T &x, U y) { if (y < x) x = y; }
template<typename T, typename U> static void amax(T &x, U y) { if (x < y) x = y; }

int main() {
	int N; int K;
	while (~scanf("%d%d", &N, &K)) {
		vector<int> a(N);
		for (int i = 0; i < N; ++i)
			scanf("%d", &a[i]);
		vector<ll> sum(N + 1), possum(N + 1);
		rep(i, N) {
			sum[i + 1] = sum[i] + a[i];
			possum[i + 1] = possum[i] + max(a[i], 0);
		}
		ll ans = 0;
		rer(i, 0, N - K) {
			amax(ans, possum[i] + (possum[N] - possum[i + K]));
			amax(ans, possum[i] + (sum[i + K] - sum[i]) + (possum[N] - possum[i + K]));
		}
		printf("%lld\n", ans);
	}
	return 0;
}

Submission Info

Submission Time
Task B - Contiguous Repainting
User anta
Language C++14 (GCC 5.4.1)
Score 400
Code Size 1097 Byte
Status AC
Exec Time 19 ms
Memory 2176 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:16:22: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
    scanf("%d", &a[i]);
                      ^

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 2 ms 256 KB
0_01.txt AC 3 ms 256 KB
0_02.txt AC 2 ms 256 KB
0_03.txt AC 2 ms 256 KB
1_00.txt AC 2 ms 256 KB
1_01.txt AC 2 ms 256 KB
1_02.txt AC 3 ms 256 KB
1_03.txt AC 12 ms 2176 KB
1_04.txt AC 19 ms 2176 KB
1_05.txt AC 19 ms 2176 KB
1_06.txt AC 17 ms 2176 KB
1_07.txt AC 17 ms 2176 KB
1_08.txt AC 17 ms 2176 KB
1_09.txt AC 17 ms 2176 KB
1_10.txt AC 16 ms 2176 KB
1_11.txt AC 17 ms 2176 KB
1_12.txt AC 16 ms 2176 KB
1_13.txt AC 17 ms 2176 KB
1_14.txt AC 16 ms 2176 KB
1_15.txt AC 17 ms 2176 KB
1_16.txt AC 17 ms 2176 KB
1_17.txt AC 16 ms 2176 KB
1_18.txt AC 17 ms 2176 KB
1_19.txt AC 16 ms 2176 KB
1_20.txt AC 16 ms 2176 KB
1_21.txt AC 17 ms 2176 KB