Submission #1515285


Source Code Expand

#include <bits/stdc++.h>
using namespace std;

typedef unsigned long long ull;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<double, double> pdd;
const ull mod = 1e9 + 7;
#define REP(i,n) for(int i=0;i<(int)n;++i)

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

Submission Info

Submission Time
Task B - Contiguous Repainting
User theory_and_me
Language C++14 (GCC 5.4.1)
Score 400
Code Size 692 Byte
Status AC
Exec Time 48 ms
Memory 2560 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 18 ms 2560 KB
1_04.txt AC 45 ms 2560 KB
1_05.txt AC 48 ms 2560 KB
1_06.txt AC 42 ms 2560 KB
1_07.txt AC 42 ms 2560 KB
1_08.txt AC 43 ms 2560 KB
1_09.txt AC 43 ms 2560 KB
1_10.txt AC 42 ms 2560 KB
1_11.txt AC 43 ms 2560 KB
1_12.txt AC 43 ms 2560 KB
1_13.txt AC 43 ms 2560 KB
1_14.txt AC 41 ms 2560 KB
1_15.txt AC 44 ms 2560 KB
1_16.txt AC 43 ms 2560 KB
1_17.txt AC 41 ms 2560 KB
1_18.txt AC 43 ms 2560 KB
1_19.txt AC 41 ms 2560 KB
1_20.txt AC 43 ms 2560 KB
1_21.txt AC 43 ms 2560 KB