#include <bits/stdc++.h>
#define ii pair<int, int>
#define X first
#define Y second
#define pb push_back
#define mp make_pair
#define vi vector<int>
#define vii vector< pair<int, int> >
typedef long long ll;
using namespace std;
int A[100005];
ll B[100005];
ll sum(int a, int b)
{
return B[b] - B[a-1];
}
ll dp[2][100005];
int opt[205][100005];
void solve(int k, int L, int R, int i, int j)
{
if(L> R) return;
int M = (L+R)/2;
ll best = -1e9;
int add = 0;
//printf("dp[%d][%d]:\n", k, M);
for(int p = max(i, 2); p<= min(j, M); p++)
{
ll here = dp[1-k%2][p-1] + sum(1, p-1)*sum(p, M);
//printf("p = %d %lld %lld = %lld\n", p, dp[k-1][p-1], sum(1, p-1)*sum(p, M), here);
if(here> best)
{
best = here;
add = p;
}
}
dp[k%2][M] = best;
opt[k][M] = add;
//printf("dp[%d][%d] = %lld\n", k, M, best);
solve(k, L, M-1, i, add);
solve(k, M+1, R, add, j);
}
int main()
{
//freopen("50", "r", stdin);
//freopen("50.out", "w", stdout);
int n, k; scanf("%d %d", &n, &k);
k++;
for(int i = 1; i<= n; i++)
{
scanf("%d", A+i);
B[i] = B[i-1] + A[i];
}
for(int i = 1; i<= n; i++) dp[1][i] = 0;
for(int i = 2; i<= k; i++) solve(i, 1, n, 1, n);
printf("%lld\n", dp[k%2][n]);
vector<int> cut;
int remk = k, remn = n;
while(remk>0 && remn>= 0)
{
if(opt[remk][remn]) cut.pb(opt[remk][remn]-1);
else break;
remn = opt[remk][remn]-1;
remk--;
}
reverse(cut.begin(), cut.end());
for(auto x : cut) printf("%d ", x);
return 0;
}
Compilation message
sequence.cpp: In function 'int main()':
sequence.cpp:46:37: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
int n, k; scanf("%d %d", &n, &k);
^
sequence.cpp:50:25: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
scanf("%d", A+i);
^
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
84836 KB |
contestant found the optimal answer: 108 == 108 |
| 2 |
Correct |
0 ms |
84836 KB |
contestant found the optimal answer: 999 == 999 |
| 3 |
Correct |
0 ms |
84836 KB |
contestant found the optimal answer: 0 == 0 |
| 4 |
Correct |
0 ms |
84836 KB |
contestant found the optimal answer: 1542524 == 1542524 |
| 5 |
Correct |
0 ms |
84836 KB |
contestant found the optimal answer: 4500000000 == 4500000000 |
| 6 |
Correct |
0 ms |
84836 KB |
contestant found the optimal answer: 1 == 1 |
| 7 |
Correct |
0 ms |
84836 KB |
contestant found the optimal answer: 1 == 1 |
| 8 |
Correct |
0 ms |
84836 KB |
contestant found the optimal answer: 1 == 1 |
| 9 |
Correct |
0 ms |
84836 KB |
contestant found the optimal answer: 100400096 == 100400096 |
| 10 |
Correct |
0 ms |
84836 KB |
contestant found the optimal answer: 900320000 == 900320000 |
| 11 |
Correct |
0 ms |
84836 KB |
contestant found the optimal answer: 3698080248 == 3698080248 |
| 12 |
Correct |
0 ms |
84836 KB |
contestant found the optimal answer: 3200320000 == 3200320000 |
| 13 |
Correct |
0 ms |
84836 KB |
contestant found the optimal answer: 140072 == 140072 |
| 14 |
Correct |
0 ms |
84836 KB |
contestant found the optimal answer: 376041456 == 376041456 |
| 15 |
Correct |
0 ms |
84836 KB |
contestant found the optimal answer: 805 == 805 |
| 16 |
Correct |
0 ms |
84836 KB |
contestant found the optimal answer: 900189994 == 900189994 |
| 17 |
Correct |
0 ms |
84836 KB |
contestant found the optimal answer: 999919994 == 999919994 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
84836 KB |
contestant found the optimal answer: 1093956 == 1093956 |
| 2 |
Correct |
0 ms |
84836 KB |
contestant found the optimal answer: 302460000 == 302460000 |
| 3 |
Correct |
0 ms |
84836 KB |
contestant found the optimal answer: 122453454361 == 122453454361 |
| 4 |
Correct |
0 ms |
84836 KB |
contestant found the optimal answer: 93663683509 == 93663683509 |
| 5 |
Correct |
0 ms |
84836 KB |
contestant found the optimal answer: 1005304678 == 1005304678 |
| 6 |
Correct |
0 ms |
84836 KB |
contestant found the optimal answer: 933702 == 933702 |
| 7 |
Correct |
0 ms |
84836 KB |
contestant found the optimal answer: 25082842857 == 25082842857 |
| 8 |
Correct |
0 ms |
84836 KB |
contestant found the optimal answer: 687136 == 687136 |
| 9 |
Correct |
0 ms |
84836 KB |
contestant found the optimal answer: 27295930079 == 27295930079 |
| 10 |
Correct |
0 ms |
84836 KB |
contestant found the optimal answer: 29000419931 == 29000419931 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
84836 KB |
contestant found the optimal answer: 610590000 == 610590000 |
| 2 |
Correct |
0 ms |
84836 KB |
contestant found the optimal answer: 311760000 == 311760000 |
| 3 |
Correct |
0 ms |
84836 KB |
contestant found the optimal answer: 1989216017013 == 1989216017013 |
| 4 |
Correct |
0 ms |
84836 KB |
contestant found the optimal answer: 1499437552673 == 1499437552673 |
| 5 |
Correct |
0 ms |
84836 KB |
contestant found the optimal answer: 1019625819 == 1019625819 |
| 6 |
Correct |
0 ms |
84836 KB |
contestant found the optimal answer: 107630884 == 107630884 |
| 7 |
Correct |
0 ms |
84836 KB |
contestant found the optimal answer: 475357671774 == 475357671774 |
| 8 |
Correct |
0 ms |
84836 KB |
contestant found the optimal answer: 193556962 == 193556962 |
| 9 |
Correct |
0 ms |
84836 KB |
contestant found the optimal answer: 482389919803 == 482389919803 |
| 10 |
Correct |
0 ms |
84836 KB |
contestant found the optimal answer: 490686959791 == 490686959791 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
84836 KB |
contestant found the optimal answer: 21503404 == 21503404 |
| 2 |
Correct |
0 ms |
84836 KB |
contestant found the optimal answer: 140412195 == 140412195 |
| 3 |
Correct |
6 ms |
84836 KB |
contestant found the optimal answer: 49729674225461 == 49729674225461 |
| 4 |
Correct |
0 ms |
84836 KB |
contestant found the optimal answer: 37485571387523 == 37485571387523 |
| 5 |
Correct |
9 ms |
84836 KB |
contestant found the optimal answer: 679388326 == 679388326 |
| 6 |
Correct |
9 ms |
84836 KB |
contestant found the optimal answer: 4699030287 == 4699030287 |
| 7 |
Correct |
6 ms |
84836 KB |
contestant found the optimal answer: 12418819758185 == 12418819758185 |
| 8 |
Correct |
6 ms |
84836 KB |
contestant found the optimal answer: 31093317350 == 31093317350 |
| 9 |
Correct |
0 ms |
84836 KB |
contestant found the optimal answer: 12194625429236 == 12194625429236 |
| 10 |
Correct |
3 ms |
84836 KB |
contestant found the optimal answer: 12345131038664 == 12345131038664 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
3 ms |
84836 KB |
contestant found the optimal answer: 1818678304 == 1818678304 |
| 2 |
Correct |
3 ms |
84836 KB |
contestant found the optimal answer: 1326260195 == 1326260195 |
| 3 |
Correct |
73 ms |
84836 KB |
contestant found the optimal answer: 4973126687469639 == 4973126687469639 |
| 4 |
Correct |
0 ms |
84836 KB |
contestant found the optimal answer: 3748491676694116 == 3748491676694116 |
| 5 |
Correct |
89 ms |
84836 KB |
contestant found the optimal answer: 1085432199 == 1085432199 |
| 6 |
Correct |
93 ms |
84836 KB |
contestant found the optimal answer: 514790755404 == 514790755404 |
| 7 |
Correct |
79 ms |
84836 KB |
contestant found the optimal answer: 1256105310476641 == 1256105310476641 |
| 8 |
Correct |
56 ms |
84836 KB |
contestant found the optimal answer: 3099592898816 == 3099592898816 |
| 9 |
Correct |
79 ms |
84836 KB |
contestant found the optimal answer: 1241131419367412 == 1241131419367412 |
| 10 |
Correct |
96 ms |
84836 KB |
contestant found the optimal answer: 1243084101967798 == 1243084101967798 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
26 ms |
84836 KB |
contestant found the optimal answer: 19795776960 == 19795776960 |
| 2 |
Correct |
33 ms |
84836 KB |
contestant found the optimal answer: 19874432173 == 19874432173 |
| 3 |
Correct |
819 ms |
84836 KB |
contestant found the optimal answer: 497313449256899208 == 497313449256899208 |
| 4 |
Correct |
33 ms |
84836 KB |
contestant found the optimal answer: 374850090734572421 == 374850090734572421 |
| 5 |
Correct |
1629 ms |
84836 KB |
contestant found the optimal answer: 36183271951 == 36183271951 |
| 6 |
Correct |
1022 ms |
84836 KB |
contestant found the optimal answer: 51629847150471 == 51629847150471 |
| 7 |
Correct |
866 ms |
84836 KB |
contestant found the optimal answer: 124074747024496432 == 124074747024496432 |
| 8 |
Correct |
636 ms |
84836 KB |
contestant found the optimal answer: 309959349080800 == 309959349080800 |
| 9 |
Correct |
863 ms |
84836 KB |
contestant found the optimal answer: 124113525649823701 == 124113525649823701 |
| 10 |
Correct |
1086 ms |
84836 KB |
contestant found the optimal answer: 124309619349406845 == 124309619349406845 |
