#include <bits/stdc++.h>
#define fast ios_base::sync_with_stdio(0);cin.tie(NULL);cout.tie(NULL)
#define S second
#define F first
#define pb push_back
using namespace std;
const int N = 1e6 + 5;
const int MOD = 1e9 + 7;
long long a[N], pre[N];
int par[100005][205], n, k;
vector<long long> dp(N), cur_dp(N);
long long C(int i, int j){
return (pre[i] - pre[j]) * pre[j];
}
void compute(int l, int r, int tl, int tr, int kk){
if(l > r)
return;
int mid = (l + r) / 2;
pair<long long, int> p = {INT_MIN, mid};
for(int i = tl; i < min(mid, tr + 1); ++i){
if((dp[i] + C(mid, i)) > p.F){
p.F = dp[i] + C(mid, i);
p.S = i;
}
}
par[mid][kk] = p.S;
cur_dp[mid] = p.F;
compute(l, mid - 1, tl, p.S, kk);
compute(mid + 1, r, p.S, tr, kk);
}
void solve(){
cin >> n >> k;
for(int i = n - 1; i >= 0; --i)
cin >> a[i];
pre[0] = a[0];
for(int i = 1; i < n; ++i)
pre[i] = pre[i - 1] + a[i];
for(int i = 1; i <= k; ++i){
compute(0, n - 1, 0, n - 1, i);
dp = cur_dp;
}
cout << dp[n - 1] << '\n';
int pos = n - 1, ct = k;
while(ct > 0){
cout << n - par[pos][ct] - 1 << ' ';
pos = par[pos][ct];
--ct;
}
}
int main(){
fast;
int t = 1;
// cin >> t;
while(t--)
solve();
return 0;
}
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
10 ms |
15948 KB |
contestant found the optimal answer: 108 == 108 |
| 2 |
Correct |
9 ms |
15988 KB |
contestant found the optimal answer: 999 == 999 |
| 3 |
Correct |
9 ms |
15892 KB |
contestant found the optimal answer: 0 == 0 |
| 4 |
Correct |
13 ms |
15948 KB |
contestant found the optimal answer: 1542524 == 1542524 |
| 5 |
Correct |
18 ms |
15948 KB |
contestant found the optimal answer: 4500000000 == 4500000000 |
| 6 |
Correct |
8 ms |
15948 KB |
contestant found the optimal answer: 1 == 1 |
| 7 |
Correct |
8 ms |
15984 KB |
contestant found the optimal answer: 1 == 1 |
| 8 |
Correct |
8 ms |
15948 KB |
contestant found the optimal answer: 1 == 1 |
| 9 |
Correct |
10 ms |
15948 KB |
contestant found the optimal answer: 100400096 == 100400096 |
| 10 |
Correct |
10 ms |
15948 KB |
contestant found the optimal answer: 900320000 == 900320000 |
| 11 |
Correct |
10 ms |
15948 KB |
contestant found the optimal answer: 3698080248 == 3698080248 |
| 12 |
Correct |
11 ms |
15948 KB |
contestant found the optimal answer: 3200320000 == 3200320000 |
| 13 |
Correct |
11 ms |
15948 KB |
contestant found the optimal answer: 140072 == 140072 |
| 14 |
Correct |
10 ms |
15976 KB |
contestant found the optimal answer: 376041456 == 376041456 |
| 15 |
Correct |
11 ms |
15948 KB |
contestant found the optimal answer: 805 == 805 |
| 16 |
Correct |
9 ms |
15920 KB |
contestant found the optimal answer: 900189994 == 900189994 |
| 17 |
Correct |
11 ms |
15996 KB |
contestant found the optimal answer: 999919994 == 999919994 |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
10 ms |
15988 KB |
contestant found the optimal answer: 1093956 == 1093956 |
| 2 |
Correct |
9 ms |
16044 KB |
contestant found the optimal answer: 302460000 == 302460000 |
| 3 |
Correct |
59 ms |
15948 KB |
contestant found the optimal answer: 122453454361 == 122453454361 |
| 4 |
Correct |
11 ms |
15932 KB |
contestant found the optimal answer: 93663683509 == 93663683509 |
| 5 |
Correct |
20 ms |
16048 KB |
contestant found the optimal answer: 1005304678 == 1005304678 |
| 6 |
Correct |
15 ms |
15948 KB |
contestant found the optimal answer: 933702 == 933702 |
| 7 |
Correct |
34 ms |
16040 KB |
contestant found the optimal answer: 25082842857 == 25082842857 |
| 8 |
Correct |
21 ms |
16060 KB |
contestant found the optimal answer: 687136 == 687136 |
| 9 |
Correct |
14 ms |
16048 KB |
contestant found the optimal answer: 27295930079 == 27295930079 |
| 10 |
Correct |
21 ms |
15948 KB |
contestant found the optimal answer: 29000419931 == 29000419931 |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
10 ms |
16076 KB |
contestant found the optimal answer: 610590000 == 610590000 |
| 2 |
Correct |
9 ms |
16152 KB |
contestant found the optimal answer: 311760000 == 311760000 |
| 3 |
Correct |
220 ms |
16156 KB |
contestant found the optimal answer: 1989216017013 == 1989216017013 |
| 4 |
Correct |
13 ms |
16076 KB |
contestant found the optimal answer: 1499437552673 == 1499437552673 |
| 5 |
Correct |
165 ms |
16152 KB |
contestant found the optimal answer: 1019625819 == 1019625819 |
| 6 |
Correct |
196 ms |
16076 KB |
contestant found the optimal answer: 107630884 == 107630884 |
| 7 |
Correct |
216 ms |
16076 KB |
contestant found the optimal answer: 475357671774 == 475357671774 |
| 8 |
Correct |
53 ms |
16076 KB |
contestant found the optimal answer: 193556962 == 193556962 |
| 9 |
Correct |
37 ms |
16076 KB |
contestant found the optimal answer: 482389919803 == 482389919803 |
| 10 |
Correct |
68 ms |
16076 KB |
contestant found the optimal answer: 490686959791 == 490686959791 |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
11 ms |
16768 KB |
contestant found the optimal answer: 21503404 == 21503404 |
| 2 |
Correct |
10 ms |
16716 KB |
contestant found the optimal answer: 140412195 == 140412195 |
| 3 |
Correct |
232 ms |
16808 KB |
contestant found the optimal answer: 49729674225461 == 49729674225461 |
| 4 |
Correct |
11 ms |
16716 KB |
contestant found the optimal answer: 37485571387523 == 37485571387523 |
| 5 |
Correct |
235 ms |
16836 KB |
contestant found the optimal answer: 679388326 == 679388326 |
| 6 |
Correct |
216 ms |
16800 KB |
contestant found the optimal answer: 4699030287 == 4699030287 |
| 7 |
Correct |
244 ms |
16716 KB |
contestant found the optimal answer: 12418819758185 == 12418819758185 |
| 8 |
Correct |
228 ms |
16812 KB |
contestant found the optimal answer: 31093317350 == 31093317350 |
| 9 |
Correct |
51 ms |
16812 KB |
contestant found the optimal answer: 12194625429236 == 12194625429236 |
| 10 |
Correct |
97 ms |
16716 KB |
contestant found the optimal answer: 12345131038664 == 12345131038664 |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
18 ms |
24192 KB |
contestant found the optimal answer: 1818678304 == 1818678304 |
| 2 |
Correct |
15 ms |
24140 KB |
contestant found the optimal answer: 1326260195 == 1326260195 |
| 3 |
Correct |
296 ms |
24140 KB |
contestant found the optimal answer: 4973126687469639 == 4973126687469639 |
| 4 |
Correct |
16 ms |
24196 KB |
contestant found the optimal answer: 3748491676694116 == 3748491676694116 |
| 5 |
Correct |
216 ms |
24140 KB |
contestant found the optimal answer: 1085432199 == 1085432199 |
| 6 |
Correct |
224 ms |
24172 KB |
contestant found the optimal answer: 514790755404 == 514790755404 |
| 7 |
Correct |
237 ms |
24172 KB |
contestant found the optimal answer: 1256105310476641 == 1256105310476641 |
| 8 |
Correct |
193 ms |
24132 KB |
contestant found the optimal answer: 3099592898816 == 3099592898816 |
| 9 |
Correct |
230 ms |
24164 KB |
contestant found the optimal answer: 1241131419367412 == 1241131419367412 |
| 10 |
Correct |
290 ms |
24140 KB |
contestant found the optimal answer: 1243084101967798 == 1243084101967798 |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
55 ms |
97672 KB |
contestant found the optimal answer: 19795776960 == 19795776960 |
| 2 |
Correct |
55 ms |
97916 KB |
contestant found the optimal answer: 19874432173 == 19874432173 |
| 3 |
Correct |
974 ms |
98308 KB |
contestant found the optimal answer: 497313449256899208 == 497313449256899208 |
| 4 |
Correct |
56 ms |
98292 KB |
contestant found the optimal answer: 374850090734572421 == 374850090734572421 |
| 5 |
Correct |
1461 ms |
97988 KB |
contestant found the optimal answer: 36183271951 == 36183271951 |
| 6 |
Correct |
937 ms |
97992 KB |
contestant found the optimal answer: 51629847150471 == 51629847150471 |
| 7 |
Correct |
895 ms |
98400 KB |
contestant found the optimal answer: 124074747024496432 == 124074747024496432 |
| 8 |
Correct |
705 ms |
98164 KB |
contestant found the optimal answer: 309959349080800 == 309959349080800 |
| 9 |
Correct |
822 ms |
98240 KB |
contestant found the optimal answer: 124113525649823701 == 124113525649823701 |
| 10 |
Correct |
1029 ms |
98140 KB |
contestant found the optimal answer: 124309619349406845 == 124309619349406845 |
