#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 1;
const int K = 201;
int n,k;
int a[N],op[K][N];
long long s[N],dp[2][N];
vector<int> ans;
void compute(int l,int r,int optl,int optr,int f,int id)
{
if(l>r) return;
int mid = (l+r)/2;
long long val = -1;
int opt = 1;
for(int k = optl;k <= min(mid-1,optr);k++)
{
long long now = dp[f^1][k]+(s[mid]-s[k])*(s[k]);
if(now>val) val = now,opt = k;
}
op[id][mid] = opt,dp[f][mid] = val;
compute(l,mid-1,optl,opt,f,id);
compute(mid+1,r,opt,optr,f,id);
}
int main()
{
ios_base::sync_with_stdio(0); cin.tie(0);
cin >> n >> k;
for(int i = 1;i <= n;i++) cin >> a[i],s[i] = s[i-1]+a[i];
for(int i = 1;i <= k;i++) compute(1,n,1,n,i%2,i);
cout << dp[k%2][n] << '\n';
for(int i = k,x = n;i >= 1;i--) ans.push_back(x = op[i][x]);
reverse(ans.begin(),ans.end());
for(int x : ans) cout << x << ' ';
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
5 ms |
384 KB |
contestant found the optimal answer: 108 == 108 |
| 2 |
Correct |
4 ms |
384 KB |
contestant found the optimal answer: 999 == 999 |
| 3 |
Correct |
4 ms |
384 KB |
contestant found the optimal answer: 0 == 0 |
| 4 |
Correct |
4 ms |
384 KB |
contestant found the optimal answer: 1542524 == 1542524 |
| 5 |
Correct |
4 ms |
384 KB |
contestant found the optimal answer: 4500000000 == 4500000000 |
| 6 |
Correct |
4 ms |
384 KB |
contestant found the optimal answer: 1 == 1 |
| 7 |
Correct |
4 ms |
384 KB |
contestant found the optimal answer: 1 == 1 |
| 8 |
Correct |
4 ms |
384 KB |
contestant found the optimal answer: 1 == 1 |
| 9 |
Correct |
4 ms |
384 KB |
contestant found the optimal answer: 100400096 == 100400096 |
| 10 |
Correct |
4 ms |
384 KB |
contestant found the optimal answer: 900320000 == 900320000 |
| 11 |
Correct |
5 ms |
384 KB |
contestant found the optimal answer: 3698080248 == 3698080248 |
| 12 |
Correct |
4 ms |
384 KB |
contestant found the optimal answer: 3200320000 == 3200320000 |
| 13 |
Correct |
4 ms |
384 KB |
contestant found the optimal answer: 140072 == 140072 |
| 14 |
Correct |
4 ms |
384 KB |
contestant found the optimal answer: 376041456 == 376041456 |
| 15 |
Correct |
4 ms |
384 KB |
contestant found the optimal answer: 805 == 805 |
| 16 |
Correct |
4 ms |
384 KB |
contestant found the optimal answer: 900189994 == 900189994 |
| 17 |
Correct |
4 ms |
384 KB |
contestant found the optimal answer: 999919994 == 999919994 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
4 ms |
384 KB |
contestant found the optimal answer: 1093956 == 1093956 |
| 2 |
Correct |
5 ms |
384 KB |
contestant found the optimal answer: 302460000 == 302460000 |
| 3 |
Correct |
5 ms |
640 KB |
contestant found the optimal answer: 122453454361 == 122453454361 |
| 4 |
Correct |
4 ms |
384 KB |
contestant found the optimal answer: 93663683509 == 93663683509 |
| 5 |
Correct |
4 ms |
384 KB |
contestant found the optimal answer: 1005304678 == 1005304678 |
| 6 |
Correct |
4 ms |
384 KB |
contestant found the optimal answer: 933702 == 933702 |
| 7 |
Correct |
5 ms |
512 KB |
contestant found the optimal answer: 25082842857 == 25082842857 |
| 8 |
Correct |
4 ms |
384 KB |
contestant found the optimal answer: 687136 == 687136 |
| 9 |
Correct |
4 ms |
384 KB |
contestant found the optimal answer: 27295930079 == 27295930079 |
| 10 |
Correct |
5 ms |
512 KB |
contestant found the optimal answer: 29000419931 == 29000419931 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
4 ms |
384 KB |
contestant found the optimal answer: 610590000 == 610590000 |
| 2 |
Correct |
4 ms |
384 KB |
contestant found the optimal answer: 311760000 == 311760000 |
| 3 |
Correct |
6 ms |
1408 KB |
contestant found the optimal answer: 1989216017013 == 1989216017013 |
| 4 |
Correct |
5 ms |
384 KB |
contestant found the optimal answer: 1499437552673 == 1499437552673 |
| 5 |
Correct |
5 ms |
1152 KB |
contestant found the optimal answer: 1019625819 == 1019625819 |
| 6 |
Correct |
6 ms |
1408 KB |
contestant found the optimal answer: 107630884 == 107630884 |
| 7 |
Correct |
6 ms |
1408 KB |
contestant found the optimal answer: 475357671774 == 475357671774 |
| 8 |
Correct |
5 ms |
640 KB |
contestant found the optimal answer: 193556962 == 193556962 |
| 9 |
Correct |
5 ms |
512 KB |
contestant found the optimal answer: 482389919803 == 482389919803 |
| 10 |
Correct |
5 ms |
640 KB |
contestant found the optimal answer: 490686959791 == 490686959791 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
5 ms |
384 KB |
contestant found the optimal answer: 21503404 == 21503404 |
| 2 |
Correct |
5 ms |
384 KB |
contestant found the optimal answer: 140412195 == 140412195 |
| 3 |
Correct |
10 ms |
2048 KB |
contestant found the optimal answer: 49729674225461 == 49729674225461 |
| 4 |
Correct |
5 ms |
384 KB |
contestant found the optimal answer: 37485571387523 == 37485571387523 |
| 5 |
Correct |
13 ms |
2176 KB |
contestant found the optimal answer: 679388326 == 679388326 |
| 6 |
Correct |
14 ms |
1968 KB |
contestant found the optimal answer: 4699030287 == 4699030287 |
| 7 |
Correct |
11 ms |
2176 KB |
contestant found the optimal answer: 12418819758185 == 12418819758185 |
| 8 |
Correct |
10 ms |
2048 KB |
contestant found the optimal answer: 31093317350 == 31093317350 |
| 9 |
Correct |
6 ms |
768 KB |
contestant found the optimal answer: 12194625429236 == 12194625429236 |
| 10 |
Correct |
8 ms |
1024 KB |
contestant found the optimal answer: 12345131038664 == 12345131038664 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
7 ms |
768 KB |
contestant found the optimal answer: 1818678304 == 1818678304 |
| 2 |
Correct |
6 ms |
768 KB |
contestant found the optimal answer: 1326260195 == 1326260195 |
| 3 |
Correct |
61 ms |
9336 KB |
contestant found the optimal answer: 4973126687469639 == 4973126687469639 |
| 4 |
Correct |
6 ms |
768 KB |
contestant found the optimal answer: 3748491676694116 == 3748491676694116 |
| 5 |
Correct |
74 ms |
5880 KB |
contestant found the optimal answer: 1085432199 == 1085432199 |
| 6 |
Correct |
71 ms |
6776 KB |
contestant found the optimal answer: 514790755404 == 514790755404 |
| 7 |
Correct |
68 ms |
7164 KB |
contestant found the optimal answer: 1256105310476641 == 1256105310476641 |
| 8 |
Correct |
44 ms |
6008 KB |
contestant found the optimal answer: 3099592898816 == 3099592898816 |
| 9 |
Correct |
66 ms |
6776 KB |
contestant found the optimal answer: 1241131419367412 == 1241131419367412 |
| 10 |
Correct |
81 ms |
8568 KB |
contestant found the optimal answer: 1243084101967798 == 1243084101967798 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
29 ms |
4224 KB |
contestant found the optimal answer: 19795776960 == 19795776960 |
| 2 |
Correct |
27 ms |
4216 KB |
contestant found the optimal answer: 19874432173 == 19874432173 |
| 3 |
Correct |
598 ms |
81916 KB |
contestant found the optimal answer: 497313449256899208 == 497313449256899208 |
| 4 |
Correct |
23 ms |
4736 KB |
contestant found the optimal answer: 374850090734572421 == 374850090734572421 |
| 5 |
Correct |
1355 ms |
81708 KB |
contestant found the optimal answer: 36183271951 == 36183271951 |
| 6 |
Correct |
818 ms |
58108 KB |
contestant found the optimal answer: 51629847150471 == 51629847150471 |
| 7 |
Correct |
640 ms |
62328 KB |
contestant found the optimal answer: 124074747024496432 == 124074747024496432 |
| 8 |
Correct |
451 ms |
51192 KB |
contestant found the optimal answer: 309959349080800 == 309959349080800 |
| 9 |
Correct |
631 ms |
58360 KB |
contestant found the optimal answer: 124113525649823701 == 124113525649823701 |
| 10 |
Correct |
816 ms |
74028 KB |
contestant found the optimal answer: 124309619349406845 == 124309619349406845 |
