Submission #1176282
Source Code Expand
#include<cstdio> #include<cstdlib> #include<cmath> #include<iostream> #include<string> #include<stack> #include<queue> #include<vector> #include<map> #include<set> #include<algorithm> #define rep(n) for(int i=0;i<n;i++) #define repp(j, n) for(int j=0;j<n;j++) #define reppp(i, m, n) for(int i=m;i<=n;i++) #define all(c) c.begin(), c.end() #define MOD 1000000007 #define MAX 1000000001 #define INF 1410065408 using namespace std; typedef long long ll; typedef pair<ll, ll> P; struct edge{int from, to; ll cost;}; int N; int main(){ int N, K; cin >> N >> K; vector<ll> a(N); rep(N) cin >> a[i]; ll total = 0; rep(K) total += a[i]; ll max_total = total, min_total = total; int max_i = K-1, min_i = K-1; reppp(i, K, N-1){ total -= a[i-K]; total += a[i]; if(total > max_total){ max_total = total; max_i = i; }else if(total < min_total){ min_total = total; min_i = i; } } ll ans1 = 0, ans2 = 0; rep(N){ if(i+(K-1) >= max_i && i <= max_i){ ans1 += a[i]; }else if(a[i] >= 0){ ans1 += a[i]; } if(i+(K-1) >= min_i && i <= min_i){ }else if(a[i] >= 0){ ans2 += a[i]; } } cout << (ans1 > ans2 ? ans1 : ans2); }
Submission Info
Submission Time | |
---|---|
Task | B - Contiguous Repainting |
User | Noimin |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 1303 Byte |
Status | WA |
Exec Time | 47 ms |
Memory | 1024 KB |
Judge Result
Set Name | Sample | All | ||||||
---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 0 / 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 | 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 | 17 ms | 1024 KB |
1_04.txt | AC | 44 ms | 1024 KB |
1_05.txt | AC | 47 ms | 1024 KB |
1_06.txt | AC | 42 ms | 1024 KB |
1_07.txt | AC | 45 ms | 1024 KB |
1_08.txt | AC | 43 ms | 1024 KB |
1_09.txt | AC | 42 ms | 1024 KB |
1_10.txt | WA | 41 ms | 1024 KB |
1_11.txt | AC | 43 ms | 1024 KB |
1_12.txt | WA | 42 ms | 1024 KB |
1_13.txt | WA | 42 ms | 1024 KB |
1_14.txt | WA | 41 ms | 1024 KB |
1_15.txt | WA | 43 ms | 1024 KB |
1_16.txt | WA | 43 ms | 1024 KB |
1_17.txt | WA | 41 ms | 1024 KB |
1_18.txt | WA | 44 ms | 1024 KB |
1_19.txt | WA | 40 ms | 1024 KB |
1_20.txt | WA | 43 ms | 1024 KB |
1_21.txt | WA | 42 ms | 1024 KB |