#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn = 1e5 + 10;
int n, k;
ll dp[maxn][2];
ll prt[maxn];
int par[207][maxn];
void solve(int k, int l = 1 , int r = n , int ul = 1 , int ur = n){
if(l > r)return;
if(l == r){
for(int i = ul ; i <= ur and i < l ; i ++){
ll res = dp[i][!(k&1)];
res += (prt[l] - prt[i]) * (prt[n] - prt[l]);
if(res > dp[l][k&1]){
dp[l][k&1] = res;
par[k][l] = i;
}
}
}
int mid = (l + r) / 2;
for(int i = ul ; i <= ur and i < mid ; i ++){
ll res = dp[i][!(k&1)];
res += (prt[mid] - prt[i]) * (prt[n] - prt[mid]);
if(res >= dp[mid][k&1]){
dp[mid][k&1] = res;
par[k][mid] = i;
}
}
solve(k, l, mid - 1 , ul, par[k][mid]);
solve(k, mid + 1 , r , par[k][mid], ur);
}
int32_t main(){
ios::sync_with_stdio(false),cin.tie(0),cout.tie(0);
cin >> n >> k;
for(int i = 1 ; i <= n ; i ++)
cin >> prt[i], prt[i] += prt[i - 1];
for(int i = 1 ; i <= k ; i ++)
solve(i , i , n-1 , i-1 , n-1);
int ans = 1;
for(int i = 1 ; i <= n ; i ++)if(dp[i][k&1] > dp[ans][k&1])ans = i;
cout << dp[ans][k&1] << endl;
cout << ans;
while(k > 1){
cout << ' ' << par[k][ans];
ans = par[k][ans] , k --;
}
return(0);
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
332 KB |
contestant found the optimal answer: 108 == 108 |
2 |
Correct |
1 ms |
332 KB |
contestant found the optimal answer: 999 == 999 |
3 |
Correct |
1 ms |
332 KB |
contestant found the optimal answer: 0 == 0 |
4 |
Correct |
1 ms |
332 KB |
contestant found the optimal answer: 1542524 == 1542524 |
5 |
Correct |
1 ms |
332 KB |
contestant found the optimal answer: 4500000000 == 4500000000 |
6 |
Correct |
1 ms |
332 KB |
contestant found the optimal answer: 1 == 1 |
7 |
Correct |
1 ms |
332 KB |
contestant found the optimal answer: 1 == 1 |
8 |
Correct |
1 ms |
332 KB |
contestant found the optimal answer: 1 == 1 |
9 |
Correct |
1 ms |
332 KB |
contestant found the optimal answer: 100400096 == 100400096 |
10 |
Correct |
1 ms |
332 KB |
contestant found the optimal answer: 900320000 == 900320000 |
11 |
Correct |
1 ms |
332 KB |
contestant found the optimal answer: 3698080248 == 3698080248 |
12 |
Correct |
1 ms |
332 KB |
contestant found the optimal answer: 3200320000 == 3200320000 |
13 |
Correct |
1 ms |
332 KB |
contestant found the optimal answer: 140072 == 140072 |
14 |
Correct |
1 ms |
332 KB |
contestant found the optimal answer: 376041456 == 376041456 |
15 |
Correct |
1 ms |
332 KB |
contestant found the optimal answer: 805 == 805 |
16 |
Correct |
1 ms |
332 KB |
contestant found the optimal answer: 900189994 == 900189994 |
17 |
Correct |
1 ms |
332 KB |
contestant found the optimal answer: 999919994 == 999919994 |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
332 KB |
contestant found the optimal answer: 1093956 == 1093956 |
2 |
Correct |
1 ms |
332 KB |
contestant found the optimal answer: 302460000 == 302460000 |
3 |
Correct |
1 ms |
460 KB |
contestant found the optimal answer: 122453454361 == 122453454361 |
4 |
Correct |
1 ms |
332 KB |
contestant found the optimal answer: 93663683509 == 93663683509 |
5 |
Correct |
1 ms |
332 KB |
contestant found the optimal answer: 1005304678 == 1005304678 |
6 |
Correct |
1 ms |
332 KB |
contestant found the optimal answer: 933702 == 933702 |
7 |
Correct |
1 ms |
332 KB |
contestant found the optimal answer: 25082842857 == 25082842857 |
8 |
Correct |
1 ms |
332 KB |
contestant found the optimal answer: 687136 == 687136 |
9 |
Correct |
1 ms |
332 KB |
contestant found the optimal answer: 27295930079 == 27295930079 |
10 |
Correct |
1 ms |
332 KB |
contestant found the optimal answer: 29000419931 == 29000419931 |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
332 KB |
contestant found the optimal answer: 610590000 == 610590000 |
2 |
Correct |
1 ms |
332 KB |
contestant found the optimal answer: 311760000 == 311760000 |
3 |
Correct |
2 ms |
1228 KB |
contestant found the optimal answer: 1989216017013 == 1989216017013 |
4 |
Correct |
1 ms |
332 KB |
contestant found the optimal answer: 1499437552673 == 1499437552673 |
5 |
Correct |
2 ms |
972 KB |
contestant found the optimal answer: 1019625819 == 1019625819 |
6 |
Correct |
2 ms |
1100 KB |
contestant found the optimal answer: 107630884 == 107630884 |
7 |
Correct |
2 ms |
1228 KB |
contestant found the optimal answer: 475357671774 == 475357671774 |
8 |
Correct |
3 ms |
460 KB |
contestant found the optimal answer: 193556962 == 193556962 |
9 |
Correct |
1 ms |
460 KB |
contestant found the optimal answer: 482389919803 == 482389919803 |
10 |
Correct |
1 ms |
588 KB |
contestant found the optimal answer: 490686959791 == 490686959791 |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
332 KB |
contestant found the optimal answer: 21503404 == 21503404 |
2 |
Correct |
1 ms |
332 KB |
contestant found the optimal answer: 140412195 == 140412195 |
3 |
Correct |
8 ms |
1740 KB |
contestant found the optimal answer: 49729674225461 == 49729674225461 |
4 |
Correct |
1 ms |
332 KB |
contestant found the optimal answer: 37485571387523 == 37485571387523 |
5 |
Correct |
11 ms |
1868 KB |
contestant found the optimal answer: 679388326 == 679388326 |
6 |
Correct |
11 ms |
1600 KB |
contestant found the optimal answer: 4699030287 == 4699030287 |
7 |
Correct |
12 ms |
1740 KB |
contestant found the optimal answer: 12418819758185 == 12418819758185 |
8 |
Correct |
7 ms |
1740 KB |
contestant found the optimal answer: 31093317350 == 31093317350 |
9 |
Correct |
2 ms |
588 KB |
contestant found the optimal answer: 12194625429236 == 12194625429236 |
10 |
Correct |
4 ms |
844 KB |
contestant found the optimal answer: 12345131038664 == 12345131038664 |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
3 ms |
588 KB |
contestant found the optimal answer: 1818678304 == 1818678304 |
2 |
Correct |
2 ms |
588 KB |
contestant found the optimal answer: 1326260195 == 1326260195 |
3 |
Correct |
78 ms |
9324 KB |
contestant found the optimal answer: 4973126687469639 == 4973126687469639 |
4 |
Correct |
3 ms |
588 KB |
contestant found the optimal answer: 3748491676694116 == 3748491676694116 |
5 |
Correct |
80 ms |
5688 KB |
contestant found the optimal answer: 1085432199 == 1085432199 |
6 |
Correct |
64 ms |
6620 KB |
contestant found the optimal answer: 514790755404 == 514790755404 |
7 |
Correct |
81 ms |
7028 KB |
contestant found the optimal answer: 1256105310476641 == 1256105310476641 |
8 |
Correct |
56 ms |
5744 KB |
contestant found the optimal answer: 3099592898816 == 3099592898816 |
9 |
Correct |
59 ms |
6596 KB |
contestant found the optimal answer: 1241131419367412 == 1241131419367412 |
10 |
Correct |
77 ms |
8344 KB |
contestant found the optimal answer: 1243084101967798 == 1243084101967798 |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
29 ms |
3808 KB |
contestant found the optimal answer: 19795776960 == 19795776960 |
2 |
Correct |
22 ms |
3788 KB |
contestant found the optimal answer: 19874432173 == 19874432173 |
3 |
Correct |
711 ms |
80860 KB |
contestant found the optimal answer: 497313449256899208 == 497313449256899208 |
4 |
Correct |
29 ms |
3788 KB |
contestant found the optimal answer: 374850090734572421 == 374850090734572421 |
5 |
Correct |
1071 ms |
81044 KB |
contestant found the optimal answer: 36183271951 == 36183271951 |
6 |
Correct |
660 ms |
57748 KB |
contestant found the optimal answer: 51629847150471 == 51629847150471 |
7 |
Correct |
765 ms |
61764 KB |
contestant found the optimal answer: 124074747024496432 == 124074747024496432 |
8 |
Correct |
544 ms |
50756 KB |
contestant found the optimal answer: 309959349080800 == 309959349080800 |
9 |
Correct |
584 ms |
57780 KB |
contestant found the optimal answer: 124113525649823701 == 124113525649823701 |
10 |
Correct |
721 ms |
73432 KB |
contestant found the optimal answer: 124309619349406845 == 124309619349406845 |