#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int Kmax = 205, Nmax = 1e5 + 5;
ll dp[2][Nmax];
int opt[Kmax][Nmax], S[Nmax], A[Nmax];
int n, k;
ll cost(int x, int y) { return (ll) (S[y] - S[x-1]) * (S[y] - S[x-1]); }
void divide(int K, int st, int dr, int L, int R)
{
int mid = (st + dr) / 2, i;
dp[K&1][mid] = 1e18;
for(i=L; i<=R && i<mid; ++i)
{
ll C = dp[(K&1)^1][i] + cost(i+1, mid);
if(C < dp[K&1][mid]) dp[K&1][mid] = C, opt[K][mid] = i;
}
if(st <= mid-1) divide(K, st, mid-1, L, opt[K][mid]);
if(mid+1 <= dr) divide(K, mid+1, dr, opt[K][mid], R);
}
int main()
{
// freopen("input", "r", stdin);
cin.sync_with_stdio(false);
int i;
cin >> n >> k;
for(i=1; i<=n; ++i)
{
cin >> A[i];
S[i] = S[i-1] + A[i];
}
for(i=1; i<=n; ++i) dp[0][i] = 1e18;
for(i=1; i<=k+1; ++i)
{
divide(i, i, n, 0, n-1);
int j;
for(j=0; j<i; ++j) dp[i&1][j] = 1e18;
}
cout << (cost(1, n) - dp[(k+1)&1][n]) / 2 << '\n';
vector<int> positions;
for(i=k+1; i>=2; --i)
{
positions.push_back(opt[i][n]);
n = opt[i][n];
}
for(i=k-1; i>=0; --i) cout << positions[i] << ' ';
return 0;
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
376 KB |
contestant found the optimal answer: 108 == 108 |
| 2 |
Correct |
2 ms |
376 KB |
contestant found the optimal answer: 999 == 999 |
| 3 |
Correct |
3 ms |
540 KB |
contestant found the optimal answer: 0 == 0 |
| 4 |
Correct |
2 ms |
652 KB |
contestant found the optimal answer: 1542524 == 1542524 |
| 5 |
Correct |
2 ms |
652 KB |
contestant found the optimal answer: 4500000000 == 4500000000 |
| 6 |
Correct |
2 ms |
768 KB |
contestant found the optimal answer: 1 == 1 |
| 7 |
Correct |
2 ms |
768 KB |
contestant found the optimal answer: 1 == 1 |
| 8 |
Correct |
2 ms |
768 KB |
contestant found the optimal answer: 1 == 1 |
| 9 |
Correct |
2 ms |
832 KB |
contestant found the optimal answer: 100400096 == 100400096 |
| 10 |
Correct |
2 ms |
832 KB |
contestant found the optimal answer: 900320000 == 900320000 |
| 11 |
Correct |
2 ms |
832 KB |
contestant found the optimal answer: 3698080248 == 3698080248 |
| 12 |
Correct |
2 ms |
832 KB |
contestant found the optimal answer: 3200320000 == 3200320000 |
| 13 |
Correct |
3 ms |
832 KB |
contestant found the optimal answer: 140072 == 140072 |
| 14 |
Correct |
2 ms |
832 KB |
contestant found the optimal answer: 376041456 == 376041456 |
| 15 |
Correct |
2 ms |
832 KB |
contestant found the optimal answer: 805 == 805 |
| 16 |
Correct |
2 ms |
832 KB |
contestant found the optimal answer: 900189994 == 900189994 |
| 17 |
Correct |
2 ms |
832 KB |
contestant found the optimal answer: 999919994 == 999919994 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
832 KB |
contestant found the optimal answer: 1093956 == 1093956 |
| 2 |
Correct |
2 ms |
832 KB |
contestant found the optimal answer: 302460000 == 302460000 |
| 3 |
Correct |
2 ms |
1060 KB |
contestant found the optimal answer: 122453454361 == 122453454361 |
| 4 |
Correct |
2 ms |
1060 KB |
contestant found the optimal answer: 93663683509 == 93663683509 |
| 5 |
Correct |
2 ms |
1060 KB |
contestant found the optimal answer: 1005304678 == 1005304678 |
| 6 |
Correct |
2 ms |
1060 KB |
contestant found the optimal answer: 933702 == 933702 |
| 7 |
Correct |
2 ms |
1060 KB |
contestant found the optimal answer: 25082842857 == 25082842857 |
| 8 |
Correct |
3 ms |
1060 KB |
contestant found the optimal answer: 687136 == 687136 |
| 9 |
Correct |
2 ms |
1060 KB |
contestant found the optimal answer: 27295930079 == 27295930079 |
| 10 |
Correct |
2 ms |
1060 KB |
contestant found the optimal answer: 29000419931 == 29000419931 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
1060 KB |
contestant found the optimal answer: 610590000 == 610590000 |
| 2 |
Correct |
2 ms |
1060 KB |
contestant found the optimal answer: 311760000 == 311760000 |
| 3 |
Correct |
3 ms |
1864 KB |
contestant found the optimal answer: 1989216017013 == 1989216017013 |
| 4 |
Correct |
2 ms |
1864 KB |
contestant found the optimal answer: 1499437552673 == 1499437552673 |
| 5 |
Correct |
4 ms |
1864 KB |
contestant found the optimal answer: 1019625819 == 1019625819 |
| 6 |
Correct |
4 ms |
1864 KB |
contestant found the optimal answer: 107630884 == 107630884 |
| 7 |
Correct |
4 ms |
1880 KB |
contestant found the optimal answer: 475357671774 == 475357671774 |
| 8 |
Correct |
2 ms |
1880 KB |
contestant found the optimal answer: 193556962 == 193556962 |
| 9 |
Correct |
2 ms |
1880 KB |
contestant found the optimal answer: 482389919803 == 482389919803 |
| 10 |
Correct |
3 ms |
1880 KB |
contestant found the optimal answer: 490686959791 == 490686959791 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
1880 KB |
contestant found the optimal answer: 21503404 == 21503404 |
| 2 |
Correct |
3 ms |
1880 KB |
contestant found the optimal answer: 140412195 == 140412195 |
| 3 |
Correct |
9 ms |
2540 KB |
contestant found the optimal answer: 49729674225461 == 49729674225461 |
| 4 |
Correct |
2 ms |
2540 KB |
contestant found the optimal answer: 37485571387523 == 37485571387523 |
| 5 |
Correct |
13 ms |
2572 KB |
contestant found the optimal answer: 679388326 == 679388326 |
| 6 |
Correct |
13 ms |
2572 KB |
contestant found the optimal answer: 4699030287 == 4699030287 |
| 7 |
Correct |
11 ms |
2580 KB |
contestant found the optimal answer: 12418819758185 == 12418819758185 |
| 8 |
Correct |
8 ms |
2604 KB |
contestant found the optimal answer: 31093317350 == 31093317350 |
| 9 |
Correct |
12 ms |
2604 KB |
contestant found the optimal answer: 12194625429236 == 12194625429236 |
| 10 |
Correct |
7 ms |
2604 KB |
contestant found the optimal answer: 12345131038664 == 12345131038664 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
8 ms |
2604 KB |
contestant found the optimal answer: 1818678304 == 1818678304 |
| 2 |
Correct |
7 ms |
2604 KB |
contestant found the optimal answer: 1326260195 == 1326260195 |
| 3 |
Correct |
69 ms |
9932 KB |
contestant found the optimal answer: 4973126687469639 == 4973126687469639 |
| 4 |
Correct |
5 ms |
9932 KB |
contestant found the optimal answer: 3748491676694116 == 3748491676694116 |
| 5 |
Correct |
85 ms |
9932 KB |
contestant found the optimal answer: 1085432199 == 1085432199 |
| 6 |
Correct |
83 ms |
9932 KB |
contestant found the optimal answer: 514790755404 == 514790755404 |
| 7 |
Correct |
75 ms |
9932 KB |
contestant found the optimal answer: 1256105310476641 == 1256105310476641 |
| 8 |
Correct |
52 ms |
9932 KB |
contestant found the optimal answer: 3099592898816 == 3099592898816 |
| 9 |
Correct |
76 ms |
9932 KB |
contestant found the optimal answer: 1241131419367412 == 1241131419367412 |
| 10 |
Correct |
97 ms |
9932 KB |
contestant found the optimal answer: 1243084101967798 == 1243084101967798 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
36 ms |
9932 KB |
contestant found the optimal answer: 19795776960 == 19795776960 |
| 2 |
Correct |
36 ms |
9932 KB |
contestant found the optimal answer: 19874432173 == 19874432173 |
| 3 |
Correct |
720 ms |
83032 KB |
contestant found the optimal answer: 497313449256899208 == 497313449256899208 |
| 4 |
Correct |
29 ms |
83032 KB |
contestant found the optimal answer: 374850090734572421 == 374850090734572421 |
| 5 |
Correct |
1543 ms |
83920 KB |
contestant found the optimal answer: 36183271951 == 36183271951 |
| 6 |
Correct |
932 ms |
83920 KB |
contestant found the optimal answer: 51629847150471 == 51629847150471 |
| 7 |
Correct |
771 ms |
83920 KB |
contestant found the optimal answer: 124074747024496432 == 124074747024496432 |
| 8 |
Correct |
569 ms |
83920 KB |
contestant found the optimal answer: 309959349080800 == 309959349080800 |
| 9 |
Correct |
788 ms |
83920 KB |
contestant found the optimal answer: 124113525649823701 == 124113525649823701 |
| 10 |
Correct |
1049 ms |
83920 KB |
contestant found the optimal answer: 124309619349406845 == 124309619349406845 |
