// In The Name Of The Queen
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 100005, K = 209;
int n, k, lvl, P[K][N];
ll A[N], dp[2][N];
inline ll Get(int l, int r)
{
return ((A[r] - A[l]) * (A[r] - A[l]));
}
void Solve(int l, int r, int le, int ri, int j)
{
if (r < l) return ;
int md = l + r >> 1, opt = -1;
dp[j][md] = (ll)2e18;
for (int i = le; i <= min(ri, md); i ++)
if (dp[j][md] >= dp[!j][i - 1] + Get(i - 1, md))
dp[j][md] = dp[!j][i - 1] + Get(i - 1, md), opt = i;
P[lvl][md] = opt - 1;
Solve(l, md - 1, le, opt, j);
Solve(md + 1, r, opt, ri, j);
}
int main()
{
scanf("%d%d", &n, &k); k ++;
for (int i = 1; i <= n; i ++)
scanf("%lld", &A[i]), A[i] += A[i - 1];
memset(dp, 63, sizeof(dp));
dp[0][0] = 0;
for (lvl = 1; lvl <= k; lvl ++)
Solve(1, n, 1, n, lvl & 1), dp[0][0] = (ll)2e18;
printf("%lld\n", (A[n] * A[n] - dp[k & 1][n]) / 2);
vector < int > V;
for (; k > 1; k --)
V.push_back(P[k][n]), n = P[k][n];
reverse(V.begin(), V.end());
for (int i : V)
printf("%d ", i);
return 0;
}
Compilation message
sequence.cpp: In function 'void Solve(int, int, int, int, int)':
sequence.cpp:15:16: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
int md = l + r >> 1, opt = -1;
~~^~~
sequence.cpp: In function 'int main()':
sequence.cpp:26:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
scanf("%d%d", &n, &k); k ++;
~~~~~^~~~~~~~~~~~~~~~
sequence.cpp:28:29: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
scanf("%lld", &A[i]), A[i] += A[i - 1];
~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
3 ms |
1912 KB |
contestant found the optimal answer: 108 == 108 |
| 2 |
Correct |
3 ms |
1912 KB |
contestant found the optimal answer: 999 == 999 |
| 3 |
Correct |
3 ms |
1912 KB |
contestant found the optimal answer: 0 == 0 |
| 4 |
Correct |
3 ms |
1912 KB |
contestant found the optimal answer: 1542524 == 1542524 |
| 5 |
Correct |
3 ms |
1912 KB |
contestant found the optimal answer: 4500000000 == 4500000000 |
| 6 |
Correct |
3 ms |
1784 KB |
contestant found the optimal answer: 1 == 1 |
| 7 |
Correct |
3 ms |
1912 KB |
contestant found the optimal answer: 1 == 1 |
| 8 |
Correct |
3 ms |
1912 KB |
contestant found the optimal answer: 1 == 1 |
| 9 |
Correct |
3 ms |
1912 KB |
contestant found the optimal answer: 100400096 == 100400096 |
| 10 |
Correct |
3 ms |
1912 KB |
contestant found the optimal answer: 900320000 == 900320000 |
| 11 |
Correct |
3 ms |
1912 KB |
contestant found the optimal answer: 3698080248 == 3698080248 |
| 12 |
Correct |
3 ms |
1912 KB |
contestant found the optimal answer: 3200320000 == 3200320000 |
| 13 |
Correct |
3 ms |
1912 KB |
contestant found the optimal answer: 140072 == 140072 |
| 14 |
Correct |
3 ms |
1912 KB |
contestant found the optimal answer: 376041456 == 376041456 |
| 15 |
Correct |
3 ms |
1912 KB |
contestant found the optimal answer: 805 == 805 |
| 16 |
Correct |
3 ms |
1912 KB |
contestant found the optimal answer: 900189994 == 900189994 |
| 17 |
Correct |
3 ms |
1916 KB |
contestant found the optimal answer: 999919994 == 999919994 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
3 ms |
1912 KB |
contestant found the optimal answer: 1093956 == 1093956 |
| 2 |
Correct |
3 ms |
1912 KB |
contestant found the optimal answer: 302460000 == 302460000 |
| 3 |
Correct |
3 ms |
2172 KB |
contestant found the optimal answer: 122453454361 == 122453454361 |
| 4 |
Correct |
3 ms |
1912 KB |
contestant found the optimal answer: 93663683509 == 93663683509 |
| 5 |
Correct |
3 ms |
1912 KB |
contestant found the optimal answer: 1005304678 == 1005304678 |
| 6 |
Correct |
3 ms |
1912 KB |
contestant found the optimal answer: 933702 == 933702 |
| 7 |
Correct |
3 ms |
2040 KB |
contestant found the optimal answer: 25082842857 == 25082842857 |
| 8 |
Correct |
3 ms |
1912 KB |
contestant found the optimal answer: 687136 == 687136 |
| 9 |
Correct |
3 ms |
1912 KB |
contestant found the optimal answer: 27295930079 == 27295930079 |
| 10 |
Correct |
3 ms |
2040 KB |
contestant found the optimal answer: 29000419931 == 29000419931 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
3 ms |
1912 KB |
contestant found the optimal answer: 610590000 == 610590000 |
| 2 |
Correct |
3 ms |
1912 KB |
contestant found the optimal answer: 311760000 == 311760000 |
| 3 |
Correct |
5 ms |
2936 KB |
contestant found the optimal answer: 1989216017013 == 1989216017013 |
| 4 |
Correct |
3 ms |
1912 KB |
contestant found the optimal answer: 1499437552673 == 1499437552673 |
| 5 |
Correct |
5 ms |
2680 KB |
contestant found the optimal answer: 1019625819 == 1019625819 |
| 6 |
Correct |
5 ms |
2936 KB |
contestant found the optimal answer: 107630884 == 107630884 |
| 7 |
Correct |
8 ms |
3064 KB |
contestant found the optimal answer: 475357671774 == 475357671774 |
| 8 |
Correct |
4 ms |
2168 KB |
contestant found the optimal answer: 193556962 == 193556962 |
| 9 |
Correct |
3 ms |
2040 KB |
contestant found the optimal answer: 482389919803 == 482389919803 |
| 10 |
Correct |
4 ms |
2168 KB |
contestant found the optimal answer: 490686959791 == 490686959791 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
3 ms |
1912 KB |
contestant found the optimal answer: 21503404 == 21503404 |
| 2 |
Correct |
3 ms |
1916 KB |
contestant found the optimal answer: 140412195 == 140412195 |
| 3 |
Correct |
10 ms |
3704 KB |
contestant found the optimal answer: 49729674225461 == 49729674225461 |
| 4 |
Correct |
3 ms |
1912 KB |
contestant found the optimal answer: 37485571387523 == 37485571387523 |
| 5 |
Correct |
11 ms |
3704 KB |
contestant found the optimal answer: 679388326 == 679388326 |
| 6 |
Correct |
10 ms |
3448 KB |
contestant found the optimal answer: 4699030287 == 4699030287 |
| 7 |
Correct |
11 ms |
3704 KB |
contestant found the optimal answer: 12418819758185 == 12418819758185 |
| 8 |
Correct |
9 ms |
3704 KB |
contestant found the optimal answer: 31093317350 == 31093317350 |
| 9 |
Correct |
5 ms |
2296 KB |
contestant found the optimal answer: 12194625429236 == 12194625429236 |
| 10 |
Correct |
7 ms |
2680 KB |
contestant found the optimal answer: 12345131038664 == 12345131038664 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
6 ms |
2168 KB |
contestant found the optimal answer: 1818678304 == 1818678304 |
| 2 |
Correct |
5 ms |
2168 KB |
contestant found the optimal answer: 1326260195 == 1326260195 |
| 3 |
Correct |
69 ms |
10748 KB |
contestant found the optimal answer: 4973126687469639 == 4973126687469639 |
| 4 |
Correct |
5 ms |
2168 KB |
contestant found the optimal answer: 3748491676694116 == 3748491676694116 |
| 5 |
Correct |
61 ms |
7292 KB |
contestant found the optimal answer: 1085432199 == 1085432199 |
| 6 |
Correct |
60 ms |
8184 KB |
contestant found the optimal answer: 514790755404 == 514790755404 |
| 7 |
Correct |
74 ms |
8540 KB |
contestant found the optimal answer: 1256105310476641 == 1256105310476641 |
| 8 |
Correct |
51 ms |
7416 KB |
contestant found the optimal answer: 3099592898816 == 3099592898816 |
| 9 |
Correct |
57 ms |
8108 KB |
contestant found the optimal answer: 1241131419367412 == 1241131419367412 |
| 10 |
Correct |
72 ms |
9976 KB |
contestant found the optimal answer: 1243084101967798 == 1243084101967798 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
31 ms |
4216 KB |
contestant found the optimal answer: 19795776960 == 19795776960 |
| 2 |
Correct |
30 ms |
4216 KB |
contestant found the optimal answer: 19874432173 == 19874432173 |
| 3 |
Correct |
710 ms |
81324 KB |
contestant found the optimal answer: 497313449256899208 == 497313449256899208 |
| 4 |
Correct |
41 ms |
4344 KB |
contestant found the optimal answer: 374850090734572421 == 374850090734572421 |
| 5 |
Correct |
1045 ms |
81432 KB |
contestant found the optimal answer: 36183271951 == 36183271951 |
| 6 |
Correct |
627 ms |
57848 KB |
contestant found the optimal answer: 51629847150471 == 51629847150471 |
| 7 |
Correct |
766 ms |
61828 KB |
contestant found the optimal answer: 124074747024496432 == 124074747024496432 |
| 8 |
Correct |
545 ms |
50892 KB |
contestant found the optimal answer: 309959349080800 == 309959349080800 |
| 9 |
Correct |
571 ms |
57972 KB |
contestant found the optimal answer: 124113525649823701 == 124113525649823701 |
| 10 |
Correct |
727 ms |
73732 KB |
contestant found the optimal answer: 124309619349406845 == 124309619349406845 |
