#include<bits/stdc++.h>
using namespace std;
int n;
int pos[202][100100];
long long arr[100100];
long long dp[2][100100];
stack<int> ans;
void compute(int idx, int l, int r, int a, int b)
{
int mid = (l+r)>>1;
for(int i=a ; i<=min(mid, b) ; i++)
{
long long nv = dp[(idx-1)%2][i] + (arr[mid] - arr[i]) * (arr[n] - arr[mid]);
if(nv > dp[idx%2][mid])
{
dp[idx%2][mid] = nv;
pos[idx][mid] = i;
}
}
if(l == r) return ;
compute(idx, l, mid, a, pos[idx][mid]);
compute(idx, mid+1, r, pos[idx][mid], b);
}
int main()
{
int k;
scanf(" %d %d",&n,&k);
for(int i=1 ; i<=n ; i++)
{
scanf(" %lld",&arr[i]);
arr[i] += arr[i-1];
}
for(int i=1 ; i<=n ; i++)
dp[1][i] = arr[i] * (arr[n] - arr[i]);
for(int i=2 ; i<=k ; i++)
{
for(int j=1 ; j<=n ; j++)
dp[i%2][j] = 0;
compute(i, i, n, 1, n);
}
long long mv = -1;
int p;
for(int i=k ; i<n ; i++)
if(dp[k%2][i] > mv)
{
mv = dp[k%2][i];
p = i;
}
printf("%lld\n",mv);
for(int i=k ; i>=1 ; i--)
{
ans.push(p);
p = pos[i][p];
}
while(!ans.empty())
{
printf("%d ",ans.top());
ans.pop();
}
return 0;
}
/*
7 3
4 1 3 4 0 2 3
*/
Compilation message
sequence.cpp: In function 'int main()':
sequence.cpp:30:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
scanf(" %d %d",&n,&k);
~~~~~^~~~~~~~~~~~~~~~
sequence.cpp:33:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
scanf(" %lld",&arr[i]);
~~~~~^~~~~~~~~~~~~~~~~
sequence.cpp:56:15: warning: 'p' may be used uninitialized in this function [-Wmaybe-uninitialized]
p = pos[i][p];
~~~~~~~~^
| # |
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 |
5 ms |
384 KB |
contestant found the optimal answer: 1542524 == 1542524 |
| 5 |
Correct |
5 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 |
5 ms |
376 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 |
376 KB |
contestant found the optimal answer: 3698080248 == 3698080248 |
| 12 |
Correct |
5 ms |
384 KB |
contestant found the optimal answer: 3200320000 == 3200320000 |
| 13 |
Correct |
5 ms |
384 KB |
contestant found the optimal answer: 140072 == 140072 |
| 14 |
Correct |
5 ms |
384 KB |
contestant found the optimal answer: 376041456 == 376041456 |
| 15 |
Correct |
5 ms |
384 KB |
contestant found the optimal answer: 805 == 805 |
| 16 |
Correct |
5 ms |
384 KB |
contestant found the optimal answer: 900189994 == 900189994 |
| 17 |
Correct |
5 ms |
376 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 |
4 ms |
384 KB |
contestant found the optimal answer: 302460000 == 302460000 |
| 3 |
Correct |
5 ms |
512 KB |
contestant found the optimal answer: 122453454361 == 122453454361 |
| 4 |
Correct |
5 ms |
384 KB |
contestant found the optimal answer: 93663683509 == 93663683509 |
| 5 |
Correct |
5 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 |
5 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 |
384 KB |
contestant found the optimal answer: 29000419931 == 29000419931 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
5 ms |
384 KB |
contestant found the optimal answer: 610590000 == 610590000 |
| 2 |
Correct |
5 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 |
7 ms |
1152 KB |
contestant found the optimal answer: 1019625819 == 1019625819 |
| 6 |
Correct |
6 ms |
1280 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 |
12 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 |
17 ms |
2048 KB |
contestant found the optimal answer: 679388326 == 679388326 |
| 6 |
Correct |
14 ms |
1792 KB |
contestant found the optimal answer: 4699030287 == 4699030287 |
| 7 |
Correct |
14 ms |
2048 KB |
contestant found the optimal answer: 12418819758185 == 12418819758185 |
| 8 |
Correct |
11 ms |
2048 KB |
contestant found the optimal answer: 31093317350 == 31093317350 |
| 9 |
Correct |
7 ms |
640 KB |
contestant found the optimal answer: 12194625429236 == 12194625429236 |
| 10 |
Correct |
9 ms |
1024 KB |
contestant found the optimal answer: 12345131038664 == 12345131038664 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
7 ms |
640 KB |
contestant found the optimal answer: 1818678304 == 1818678304 |
| 2 |
Correct |
6 ms |
640 KB |
contestant found the optimal answer: 1326260195 == 1326260195 |
| 3 |
Correct |
78 ms |
9336 KB |
contestant found the optimal answer: 4973126687469639 == 4973126687469639 |
| 4 |
Correct |
6 ms |
640 KB |
contestant found the optimal answer: 3748491676694116 == 3748491676694116 |
| 5 |
Correct |
98 ms |
5752 KB |
contestant found the optimal answer: 1085432199 == 1085432199 |
| 6 |
Correct |
89 ms |
6648 KB |
contestant found the optimal answer: 514790755404 == 514790755404 |
| 7 |
Correct |
84 ms |
7032 KB |
contestant found the optimal answer: 1256105310476641 == 1256105310476641 |
| 8 |
Correct |
58 ms |
5880 KB |
contestant found the optimal answer: 3099592898816 == 3099592898816 |
| 9 |
Correct |
78 ms |
6652 KB |
contestant found the optimal answer: 1241131419367412 == 1241131419367412 |
| 10 |
Correct |
98 ms |
8440 KB |
contestant found the optimal answer: 1243084101967798 == 1243084101967798 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
29 ms |
3704 KB |
contestant found the optimal answer: 19795776960 == 19795776960 |
| 2 |
Correct |
28 ms |
3704 KB |
contestant found the optimal answer: 19874432173 == 19874432173 |
| 3 |
Correct |
790 ms |
81048 KB |
contestant found the optimal answer: 497313449256899208 == 497313449256899208 |
| 4 |
Correct |
25 ms |
3960 KB |
contestant found the optimal answer: 374850090734572421 == 374850090734572421 |
| 5 |
Correct |
1604 ms |
80992 KB |
contestant found the optimal answer: 36183271951 == 36183271951 |
| 6 |
Correct |
952 ms |
57464 KB |
contestant found the optimal answer: 51629847150471 == 51629847150471 |
| 7 |
Correct |
816 ms |
61560 KB |
contestant found the optimal answer: 124074747024496432 == 124074747024496432 |
| 8 |
Correct |
578 ms |
50424 KB |
contestant found the optimal answer: 309959349080800 == 309959349080800 |
| 9 |
Correct |
761 ms |
57592 KB |
contestant found the optimal answer: 124113525649823701 == 124113525649823701 |
| 10 |
Correct |
974 ms |
73212 KB |
contestant found the optimal answer: 124309619349406845 == 124309619349406845 |
