#include<bits/stdc++.h>
using namespace std;
using ll = long long;
const int N = 1e5 + 5;
const ll INF = 1e18;
int a[N]; ll f[N];
ll dp[2][N];
int path[205][N];
#define fi first
#define se second
int n, m;
struct Line {
ll a, b;
int i;
Line() = default;
Line(ll a, ll b, int i): a(a), b(b), i(i) {}
ll get(int x) {
return a * x + b;
}
} dq[N];
int front, back;
using ld = long double;
int better(const Line& a, const Line& b, const Line& c) {
// (a1-a2) * x = b2-b1
// x = (b2 - b1) / (a1 - a2)
return (a.b - b.b) * (a.a - c.a) >= (a.b - c.b) * (a.a - b.a);
}
void insert(ll a, ll b, int i) {
Line l(a, b, i);
while (back > front && better(l, dq[back], dq[back - 1])) {
back--;
}
dq[++back] = l;
}
pair<ll, int> get(int x) {
while (front < back && dq[front].get(x) <= dq[front + 1].get(x)) {
front++;
}
return make_pair(dq[front].get(x), dq[front].i);
}
int main() {
cin.tie(0)->sync_with_stdio(0); cout.tie(0);
cin >> n >> m; m++;
for (int i = 1; i <= n; ++i) {
cin >> a[i];
f[i] = f[i - 1] + a[i];
}
// if (n <= 1000) {
// task1();
// return 0;
// }
for (int k = 2; k <= m; ++k) {
int cu = k & 1, pr = cu ^ 1;
front = 0, back = -1;
for (int i = 1; i <= n; ++i) {
insert(f[i - 1], dp[pr][i - 1] - f[i - 1] * f[i - 1], i - 1);
// sum = f[j] * f[i] + dp[k - 1][j].fi - f[j] * f[j];
auto val = get(f[i]);
dp[cu][i] = val.fi;
path[k][i] = val.se;
}
}
cout << dp[m & 1][n] << '\n';
int i = m, j = n;
while (i > 1) {
cout << path[i][j] << ' ';
j = path[i][j]; i--;
}
return 0;
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
340 KB |
contestant found the optimal answer: 108 == 108 |
| 2 |
Correct |
0 ms |
340 KB |
contestant found the optimal answer: 999 == 999 |
| 3 |
Correct |
0 ms |
340 KB |
contestant found the optimal answer: 0 == 0 |
| 4 |
Correct |
1 ms |
340 KB |
contestant found the optimal answer: 1542524 == 1542524 |
| 5 |
Correct |
0 ms |
340 KB |
contestant found the optimal answer: 4500000000 == 4500000000 |
| 6 |
Correct |
0 ms |
340 KB |
contestant found the optimal answer: 1 == 1 |
| 7 |
Correct |
0 ms |
340 KB |
contestant found the optimal answer: 1 == 1 |
| 8 |
Correct |
0 ms |
340 KB |
contestant found the optimal answer: 1 == 1 |
| 9 |
Correct |
0 ms |
340 KB |
contestant found the optimal answer: 100400096 == 100400096 |
| 10 |
Correct |
0 ms |
340 KB |
contestant found the optimal answer: 900320000 == 900320000 |
| 11 |
Correct |
0 ms |
340 KB |
contestant found the optimal answer: 3698080248 == 3698080248 |
| 12 |
Correct |
0 ms |
340 KB |
contestant found the optimal answer: 3200320000 == 3200320000 |
| 13 |
Correct |
0 ms |
340 KB |
contestant found the optimal answer: 140072 == 140072 |
| 14 |
Correct |
0 ms |
340 KB |
contestant found the optimal answer: 376041456 == 376041456 |
| 15 |
Correct |
0 ms |
340 KB |
contestant found the optimal answer: 805 == 805 |
| 16 |
Correct |
0 ms |
340 KB |
contestant found the optimal answer: 900189994 == 900189994 |
| 17 |
Correct |
0 ms |
340 KB |
contestant found the optimal answer: 999919994 == 999919994 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
340 KB |
contestant found the optimal answer: 1093956 == 1093956 |
| 2 |
Correct |
0 ms |
340 KB |
contestant found the optimal answer: 302460000 == 302460000 |
| 3 |
Correct |
1 ms |
468 KB |
contestant found the optimal answer: 122453454361 == 122453454361 |
| 4 |
Correct |
0 ms |
340 KB |
contestant found the optimal answer: 93663683509 == 93663683509 |
| 5 |
Correct |
0 ms |
340 KB |
contestant found the optimal answer: 1005304678 == 1005304678 |
| 6 |
Correct |
0 ms |
340 KB |
contestant found the optimal answer: 933702 == 933702 |
| 7 |
Correct |
1 ms |
468 KB |
contestant found the optimal answer: 25082842857 == 25082842857 |
| 8 |
Correct |
0 ms |
340 KB |
contestant found the optimal answer: 687136 == 687136 |
| 9 |
Correct |
0 ms |
340 KB |
contestant found the optimal answer: 27295930079 == 27295930079 |
| 10 |
Correct |
1 ms |
340 KB |
contestant found the optimal answer: 29000419931 == 29000419931 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
340 KB |
contestant found the optimal answer: 610590000 == 610590000 |
| 2 |
Correct |
0 ms |
340 KB |
contestant found the optimal answer: 311760000 == 311760000 |
| 3 |
Correct |
1 ms |
1364 KB |
contestant found the optimal answer: 1989216017013 == 1989216017013 |
| 4 |
Correct |
0 ms |
340 KB |
contestant found the optimal answer: 1499437552673 == 1499437552673 |
| 5 |
Correct |
1 ms |
1108 KB |
contestant found the optimal answer: 1019625819 == 1019625819 |
| 6 |
Correct |
1 ms |
1236 KB |
contestant found the optimal answer: 107630884 == 107630884 |
| 7 |
Correct |
2 ms |
1364 KB |
contestant found the optimal answer: 475357671774 == 475357671774 |
| 8 |
Correct |
1 ms |
596 KB |
contestant found the optimal answer: 193556962 == 193556962 |
| 9 |
Correct |
1 ms |
468 KB |
contestant found the optimal answer: 482389919803 == 482389919803 |
| 10 |
Correct |
1 ms |
596 KB |
contestant found the optimal answer: 490686959791 == 490686959791 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
340 KB |
contestant found the optimal answer: 21503404 == 21503404 |
| 2 |
Correct |
1 ms |
340 KB |
contestant found the optimal answer: 140412195 == 140412195 |
| 3 |
Correct |
4 ms |
2004 KB |
contestant found the optimal answer: 49729674225461 == 49729674225461 |
| 4 |
Correct |
1 ms |
340 KB |
contestant found the optimal answer: 37485571387523 == 37485571387523 |
| 5 |
Correct |
6 ms |
2132 KB |
contestant found the optimal answer: 679388326 == 679388326 |
| 6 |
Correct |
4 ms |
1748 KB |
contestant found the optimal answer: 4699030287 == 4699030287 |
| 7 |
Correct |
5 ms |
2132 KB |
contestant found the optimal answer: 12418819758185 == 12418819758185 |
| 8 |
Correct |
4 ms |
2132 KB |
contestant found the optimal answer: 31093317350 == 31093317350 |
| 9 |
Correct |
1 ms |
724 KB |
contestant found the optimal answer: 12194625429236 == 12194625429236 |
| 10 |
Correct |
2 ms |
980 KB |
contestant found the optimal answer: 12345131038664 == 12345131038664 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
852 KB |
contestant found the optimal answer: 1818678304 == 1818678304 |
| 2 |
Correct |
2 ms |
852 KB |
contestant found the optimal answer: 1326260195 == 1326260195 |
| 3 |
Correct |
34 ms |
9524 KB |
contestant found the optimal answer: 4973126687469639 == 4973126687469639 |
| 4 |
Correct |
2 ms |
980 KB |
contestant found the optimal answer: 3748491676694116 == 3748491676694116 |
| 5 |
Correct |
28 ms |
5988 KB |
contestant found the optimal answer: 1085432199 == 1085432199 |
| 6 |
Correct |
29 ms |
6896 KB |
contestant found the optimal answer: 514790755404 == 514790755404 |
| 7 |
Correct |
32 ms |
7404 KB |
contestant found the optimal answer: 1256105310476641 == 1256105310476641 |
| 8 |
Correct |
21 ms |
6156 KB |
contestant found the optimal answer: 3099592898816 == 3099592898816 |
| 9 |
Correct |
26 ms |
7004 KB |
contestant found the optimal answer: 1241131419367412 == 1241131419367412 |
| 10 |
Correct |
36 ms |
8664 KB |
contestant found the optimal answer: 1243084101967798 == 1243084101967798 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
14 ms |
6100 KB |
contestant found the optimal answer: 19795776960 == 19795776960 |
| 2 |
Correct |
17 ms |
6068 KB |
contestant found the optimal answer: 19874432173 == 19874432173 |
| 3 |
Correct |
294 ms |
83628 KB |
contestant found the optimal answer: 497313449256899208 == 497313449256899208 |
| 4 |
Correct |
12 ms |
6592 KB |
contestant found the optimal answer: 374850090734572421 == 374850090734572421 |
| 5 |
Correct |
471 ms |
83148 KB |
contestant found the optimal answer: 36183271951 == 36183271951 |
| 6 |
Correct |
278 ms |
59744 KB |
contestant found the optimal answer: 51629847150471 == 51629847150471 |
| 7 |
Correct |
331 ms |
64000 KB |
contestant found the optimal answer: 124074747024496432 == 124074747024496432 |
| 8 |
Correct |
210 ms |
53132 KB |
contestant found the optimal answer: 309959349080800 == 309959349080800 |
| 9 |
Correct |
267 ms |
59980 KB |
contestant found the optimal answer: 124113525649823701 == 124113525649823701 |
| 10 |
Correct |
301 ms |
75552 KB |
contestant found the optimal answer: 124309619349406845 == 124309619349406845 |
