/*
* File created on 01/08/2022 at 17:20:18.
* Link to problem:
* Description:
* Time complexity: O()
* Space complexity: O()
* Status: ---
* Copyright: Ⓒ 2022 Francois Vogel
*/
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <functional>
using namespace std;
using namespace __gnu_pbds;
#define mp pair<pii, int>
#define pii pair<int, int>
#define f first
#define s second
#define vi vector<int>
#define all(x) x.begin(), x.end()
#define size(x) (int)((x).size())
#define pb push_back
#define ins insert
#define cls clear
#define int ll
#define ll long long
#define ld long double
typedef tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> ordered_set;
const int inf = 1e18;
ld xIntersection(int a1, int b1, int a2, int b2) {
return (ld)(b1-b2)/(ld)(a2-a1);
}
signed main() {
cin.tie(0);
ios_base::sync_with_stdio(0);
int n, kConst;
cin >> n >> kConst;
int b [n];
for (int i = 0; i < n; i++) cin >> b[i];
int p [n];
p[0] = b[0];
for (int i = 1; i < n; i++) p[i] = p[i-1]+b[i];
int sum = p[n-1];
int pdp [n+1];
int ndp [n+1];
for (int i = 0; i < n; i++) pdp[i] = -inf;
pdp[n] = 0;
signed to [kConst+1][n];
for (int i = 0; i <= kConst; i++) {
deque<mp> q;
for (int j = n-1; j >= 0; j--) {
int slope = 2*p[j];
int xint = p[j]*sum-p[j]*p[j]+pdp[j+1];
while (size(q) >= 2 && xIntersection(q[0].f.f, q[0].f.s, q[1].f.f, q[1].f.s) <= xIntersection(q[1].f.f, q[1].f.s, slope, xint)) {
q.pop_front();
}
q.push_front(mp(pii(slope, xint), j+1));
int query = 0;
if (j) query = p[j-1];
while (size(q) >= 2 && q[size(q)-2].f.f*query+q[size(q)-2].f.s >= q.back().f.f*query+q.back().f.s) {
q.pop_back();
}
to[i][j] = q.back().s;
ndp[j] = q.back().f.f*query+q.back().f.s;
if (j) ndp[j] -= p[j-1]*sum+p[j-1]*p[j-1];
}
for (int j = 0; j < n; j++) pdp[j] = ndp[j];
pdp[n] = -inf;
}
cout << pdp[0]/2 << '\n';
vi res;
int x = 0;
for (int i = kConst; i > 0; i--) {
x = to[i][x];
res.pb(x);
}
for (int i : res) cout << i << ' ';
cout.flush();
int d = 0;
d++;
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
204 KB |
contestant found the optimal answer: 108 == 108 |
| 2 |
Correct |
0 ms |
204 KB |
contestant found the optimal answer: 999 == 999 |
| 3 |
Correct |
0 ms |
204 KB |
contestant found the optimal answer: 0 == 0 |
| 4 |
Correct |
0 ms |
312 KB |
contestant found the optimal answer: 1542524 == 1542524 |
| 5 |
Correct |
0 ms |
204 KB |
contestant found the optimal answer: 4500000000 == 4500000000 |
| 6 |
Correct |
0 ms |
204 KB |
contestant found the optimal answer: 1 == 1 |
| 7 |
Correct |
1 ms |
204 KB |
contestant found the optimal answer: 1 == 1 |
| 8 |
Correct |
0 ms |
204 KB |
contestant found the optimal answer: 1 == 1 |
| 9 |
Correct |
0 ms |
204 KB |
contestant found the optimal answer: 100400096 == 100400096 |
| 10 |
Correct |
0 ms |
332 KB |
contestant found the optimal answer: 900320000 == 900320000 |
| 11 |
Correct |
0 ms |
204 KB |
contestant found the optimal answer: 3698080248 == 3698080248 |
| 12 |
Correct |
0 ms |
204 KB |
contestant found the optimal answer: 3200320000 == 3200320000 |
| 13 |
Correct |
1 ms |
204 KB |
contestant found the optimal answer: 140072 == 140072 |
| 14 |
Correct |
0 ms |
204 KB |
contestant found the optimal answer: 376041456 == 376041456 |
| 15 |
Correct |
0 ms |
204 KB |
contestant found the optimal answer: 805 == 805 |
| 16 |
Correct |
1 ms |
316 KB |
contestant found the optimal answer: 900189994 == 900189994 |
| 17 |
Correct |
0 ms |
204 KB |
contestant found the optimal answer: 999919994 == 999919994 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
300 KB |
contestant found the optimal answer: 1093956 == 1093956 |
| 2 |
Correct |
1 ms |
204 KB |
contestant found the optimal answer: 302460000 == 302460000 |
| 3 |
Correct |
1 ms |
312 KB |
contestant found the optimal answer: 122453454361 == 122453454361 |
| 4 |
Correct |
1 ms |
204 KB |
contestant found the optimal answer: 93663683509 == 93663683509 |
| 5 |
Correct |
0 ms |
308 KB |
contestant found the optimal answer: 1005304678 == 1005304678 |
| 6 |
Correct |
0 ms |
312 KB |
contestant found the optimal answer: 933702 == 933702 |
| 7 |
Correct |
0 ms |
204 KB |
contestant found the optimal answer: 25082842857 == 25082842857 |
| 8 |
Correct |
0 ms |
204 KB |
contestant found the optimal answer: 687136 == 687136 |
| 9 |
Correct |
0 ms |
204 KB |
contestant found the optimal answer: 27295930079 == 27295930079 |
| 10 |
Correct |
0 ms |
204 KB |
contestant found the optimal answer: 29000419931 == 29000419931 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
204 KB |
contestant found the optimal answer: 610590000 == 610590000 |
| 2 |
Correct |
1 ms |
204 KB |
contestant found the optimal answer: 311760000 == 311760000 |
| 3 |
Correct |
1 ms |
460 KB |
contestant found the optimal answer: 1989216017013 == 1989216017013 |
| 4 |
Correct |
0 ms |
204 KB |
contestant found the optimal answer: 1499437552673 == 1499437552673 |
| 5 |
Correct |
1 ms |
308 KB |
contestant found the optimal answer: 1019625819 == 1019625819 |
| 6 |
Correct |
1 ms |
460 KB |
contestant found the optimal answer: 107630884 == 107630884 |
| 7 |
Correct |
1 ms |
460 KB |
contestant found the optimal answer: 475357671774 == 475357671774 |
| 8 |
Correct |
1 ms |
332 KB |
contestant found the optimal answer: 193556962 == 193556962 |
| 9 |
Correct |
1 ms |
332 KB |
contestant found the optimal answer: 482389919803 == 482389919803 |
| 10 |
Correct |
1 ms |
332 KB |
contestant found the optimal answer: 490686959791 == 490686959791 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
332 KB |
contestant found the optimal answer: 21503404 == 21503404 |
| 2 |
Correct |
1 ms |
332 KB |
contestant found the optimal answer: 140412195 == 140412195 |
| 3 |
Correct |
6 ms |
1100 KB |
contestant found the optimal answer: 49729674225461 == 49729674225461 |
| 4 |
Correct |
1 ms |
332 KB |
contestant found the optimal answer: 37485571387523 == 37485571387523 |
| 5 |
Correct |
8 ms |
1100 KB |
contestant found the optimal answer: 679388326 == 679388326 |
| 6 |
Correct |
6 ms |
952 KB |
contestant found the optimal answer: 4699030287 == 4699030287 |
| 7 |
Correct |
9 ms |
1144 KB |
contestant found the optimal answer: 12418819758185 == 12418819758185 |
| 8 |
Correct |
7 ms |
1128 KB |
contestant found the optimal answer: 31093317350 == 31093317350 |
| 9 |
Correct |
2 ms |
460 KB |
contestant found the optimal answer: 12194625429236 == 12194625429236 |
| 10 |
Correct |
4 ms |
588 KB |
contestant found the optimal answer: 12345131038664 == 12345131038664 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
4 ms |
972 KB |
contestant found the optimal answer: 1818678304 == 1818678304 |
| 2 |
Correct |
3 ms |
844 KB |
contestant found the optimal answer: 1326260195 == 1326260195 |
| 3 |
Correct |
60 ms |
8648 KB |
contestant found the optimal answer: 4973126687469639 == 4973126687469639 |
| 4 |
Correct |
3 ms |
948 KB |
contestant found the optimal answer: 3748491676694116 == 3748491676694116 |
| 5 |
Correct |
57 ms |
5528 KB |
contestant found the optimal answer: 1085432199 == 1085432199 |
| 6 |
Correct |
54 ms |
6220 KB |
contestant found the optimal answer: 514790755404 == 514790755404 |
| 7 |
Correct |
66 ms |
6604 KB |
contestant found the optimal answer: 1256105310476641 == 1256105310476641 |
| 8 |
Correct |
41 ms |
5580 KB |
contestant found the optimal answer: 3099592898816 == 3099592898816 |
| 9 |
Correct |
64 ms |
6300 KB |
contestant found the optimal answer: 1241131419367412 == 1241131419367412 |
| 10 |
Correct |
72 ms |
7756 KB |
contestant found the optimal answer: 1243084101967798 == 1243084101967798 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
24 ms |
6220 KB |
contestant found the optimal answer: 19795776960 == 19795776960 |
| 2 |
Correct |
22 ms |
6148 KB |
contestant found the optimal answer: 19874432173 == 19874432173 |
| 3 |
Correct |
638 ms |
83700 KB |
contestant found the optimal answer: 497313449256899208 == 497313449256899208 |
| 4 |
Correct |
21 ms |
6724 KB |
contestant found the optimal answer: 374850090734572421 == 374850090734572421 |
| 5 |
Correct |
897 ms |
83360 KB |
contestant found the optimal answer: 36183271951 == 36183271951 |
| 6 |
Correct |
610 ms |
59696 KB |
contestant found the optimal answer: 51629847150471 == 51629847150471 |
| 7 |
Correct |
674 ms |
64156 KB |
contestant found the optimal answer: 124074747024496432 == 124074747024496432 |
| 8 |
Correct |
522 ms |
53152 KB |
contestant found the optimal answer: 309959349080800 == 309959349080800 |
| 9 |
Correct |
491 ms |
60048 KB |
contestant found the optimal answer: 124113525649823701 == 124113525649823701 |
| 10 |
Correct |
655 ms |
75708 KB |
contestant found the optimal answer: 124309619349406845 == 124309619349406845 |
