#include <bits/stdc++.h>
using namespace std;
using ll = long long;
struct line {
int idx;
ll a, b;
line(int idx, ll a, ll b) : idx(idx), a(a), b(b) {}
ll cost(ll x) const {
return a * (x - a) + b;
}
ll intersect(line const& other) {
if (a == other.a) return 1LL << 32;
return ((other.a * other.a - other.b) - (a * a - b)) / (other.a - a);
}
};
int main() {
int n, k;
cin >> n >> k;
vector<int> a(n);
for (int i = 0; i < n; ++i) {
cin >> a[i];
}
vector<ll> pref(n + 1, 0);
partial_sum(a.begin(), a.end(), pref.begin() + 1);
vector<ll> dp1(n + 1, 0);
int parent[k + 1][n + 1];
for (int i = 1; i <= k; ++i) {
vector<ll> dp2(n + 1, 0);
deque<line> dq;
for (int j = 0; j <= n; ++j) {
while (dq.size() > 1 &&
dq[0].cost(pref[j]) <= dq[1].cost(pref[j])) {
dq.pop_front();
}
if (!dq.empty()) {
dp2[j] = dq[0].cost(pref[j]);
parent[i][j] = dq[0].idx;
}
line l(j, pref[j], dp1[j]);
while (dq.size() > 1) {
int sz = dq.size();
ll t1 = dq[sz - 2].intersect(dq[sz - 1]);
ll t2 = dq[sz - 1].intersect(l);
if (t1 < t2) break;
dq.pop_back();
}
dq.push_back(l);
}
dp1 = move(dp2);
}
cout << dp1[n] << endl;
int u = n;
for (int i = k; i > 0; --i) {
u = parent[i][u];
cout << u << ' ';
}
cout << endl;
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 |
2 ms |
376 KB |
contestant found the optimal answer: 0 == 0 |
| 4 |
Correct |
2 ms |
256 KB |
contestant found the optimal answer: 1542524 == 1542524 |
| 5 |
Correct |
2 ms |
256 KB |
contestant found the optimal answer: 4500000000 == 4500000000 |
| 6 |
Correct |
2 ms |
376 KB |
contestant found the optimal answer: 1 == 1 |
| 7 |
Correct |
2 ms |
376 KB |
contestant found the optimal answer: 1 == 1 |
| 8 |
Correct |
2 ms |
256 KB |
contestant found the optimal answer: 1 == 1 |
| 9 |
Correct |
2 ms |
380 KB |
contestant found the optimal answer: 100400096 == 100400096 |
| 10 |
Correct |
2 ms |
248 KB |
contestant found the optimal answer: 900320000 == 900320000 |
| 11 |
Correct |
2 ms |
376 KB |
contestant found the optimal answer: 3698080248 == 3698080248 |
| 12 |
Correct |
2 ms |
376 KB |
contestant found the optimal answer: 3200320000 == 3200320000 |
| 13 |
Correct |
2 ms |
256 KB |
contestant found the optimal answer: 140072 == 140072 |
| 14 |
Correct |
2 ms |
376 KB |
contestant found the optimal answer: 376041456 == 376041456 |
| 15 |
Correct |
2 ms |
256 KB |
contestant found the optimal answer: 805 == 805 |
| 16 |
Correct |
2 ms |
376 KB |
contestant found the optimal answer: 900189994 == 900189994 |
| 17 |
Correct |
2 ms |
376 KB |
contestant found the optimal answer: 999919994 == 999919994 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
376 KB |
contestant found the optimal answer: 1093956 == 1093956 |
| 2 |
Correct |
2 ms |
256 KB |
contestant found the optimal answer: 302460000 == 302460000 |
| 3 |
Correct |
2 ms |
348 KB |
contestant found the optimal answer: 122453454361 == 122453454361 |
| 4 |
Correct |
2 ms |
376 KB |
contestant found the optimal answer: 93663683509 == 93663683509 |
| 5 |
Correct |
2 ms |
256 KB |
contestant found the optimal answer: 1005304678 == 1005304678 |
| 6 |
Correct |
2 ms |
256 KB |
contestant found the optimal answer: 933702 == 933702 |
| 7 |
Correct |
2 ms |
376 KB |
contestant found the optimal answer: 25082842857 == 25082842857 |
| 8 |
Correct |
2 ms |
376 KB |
contestant found the optimal answer: 687136 == 687136 |
| 9 |
Correct |
2 ms |
256 KB |
contestant found the optimal answer: 27295930079 == 27295930079 |
| 10 |
Correct |
2 ms |
252 KB |
contestant found the optimal answer: 29000419931 == 29000419931 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
256 KB |
contestant found the optimal answer: 610590000 == 610590000 |
| 2 |
Correct |
2 ms |
376 KB |
contestant found the optimal answer: 311760000 == 311760000 |
| 3 |
Correct |
4 ms |
532 KB |
contestant found the optimal answer: 1989216017013 == 1989216017013 |
| 4 |
Correct |
2 ms |
376 KB |
contestant found the optimal answer: 1499437552673 == 1499437552673 |
| 5 |
Correct |
3 ms |
376 KB |
contestant found the optimal answer: 1019625819 == 1019625819 |
| 6 |
Correct |
3 ms |
504 KB |
contestant found the optimal answer: 107630884 == 107630884 |
| 7 |
Correct |
4 ms |
504 KB |
contestant found the optimal answer: 475357671774 == 475357671774 |
| 8 |
Correct |
2 ms |
380 KB |
contestant found the optimal answer: 193556962 == 193556962 |
| 9 |
Correct |
2 ms |
376 KB |
contestant found the optimal answer: 482389919803 == 482389919803 |
| 10 |
Correct |
3 ms |
376 KB |
contestant found the optimal answer: 490686959791 == 490686959791 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
376 KB |
contestant found the optimal answer: 21503404 == 21503404 |
| 2 |
Correct |
2 ms |
376 KB |
contestant found the optimal answer: 140412195 == 140412195 |
| 3 |
Correct |
15 ms |
1144 KB |
contestant found the optimal answer: 49729674225461 == 49729674225461 |
| 4 |
Correct |
3 ms |
380 KB |
contestant found the optimal answer: 37485571387523 == 37485571387523 |
| 5 |
Correct |
15 ms |
1144 KB |
contestant found the optimal answer: 679388326 == 679388326 |
| 6 |
Correct |
14 ms |
1016 KB |
contestant found the optimal answer: 4699030287 == 4699030287 |
| 7 |
Correct |
16 ms |
1144 KB |
contestant found the optimal answer: 12418819758185 == 12418819758185 |
| 8 |
Correct |
14 ms |
1144 KB |
contestant found the optimal answer: 31093317350 == 31093317350 |
| 9 |
Correct |
5 ms |
504 KB |
contestant found the optimal answer: 12194625429236 == 12194625429236 |
| 10 |
Correct |
8 ms |
632 KB |
contestant found the optimal answer: 12345131038664 == 12345131038664 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
7 ms |
828 KB |
contestant found the optimal answer: 1818678304 == 1818678304 |
| 2 |
Correct |
7 ms |
888 KB |
contestant found the optimal answer: 1326260195 == 1326260195 |
| 3 |
Correct |
150 ms |
8492 KB |
contestant found the optimal answer: 4973126687469639 == 4973126687469639 |
| 4 |
Correct |
9 ms |
804 KB |
contestant found the optimal answer: 3748491676694116 == 3748491676694116 |
| 5 |
Correct |
105 ms |
5252 KB |
contestant found the optimal answer: 1085432199 == 1085432199 |
| 6 |
Correct |
124 ms |
6216 KB |
contestant found the optimal answer: 514790755404 == 514790755404 |
| 7 |
Correct |
130 ms |
6492 KB |
contestant found the optimal answer: 1256105310476641 == 1256105310476641 |
| 8 |
Correct |
104 ms |
5412 KB |
contestant found the optimal answer: 3099592898816 == 3099592898816 |
| 9 |
Correct |
114 ms |
6292 KB |
contestant found the optimal answer: 1241131419367412 == 1241131419367412 |
| 10 |
Correct |
144 ms |
7728 KB |
contestant found the optimal answer: 1243084101967798 == 1243084101967798 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
54 ms |
4692 KB |
contestant found the optimal answer: 19795776960 == 19795776960 |
| 2 |
Correct |
54 ms |
4796 KB |
contestant found the optimal answer: 19874432173 == 19874432173 |
| 3 |
Correct |
1510 ms |
81980 KB |
contestant found the optimal answer: 497313449256899208 == 497313449256899208 |
| 4 |
Correct |
72 ms |
5336 KB |
contestant found the optimal answer: 374850090734572421 == 374850090734572421 |
| 5 |
Correct |
1727 ms |
82336 KB |
contestant found the optimal answer: 36183271951 == 36183271951 |
| 6 |
Correct |
1301 ms |
58580 KB |
contestant found the optimal answer: 51629847150471 == 51629847150471 |
| 7 |
Correct |
1290 ms |
63020 KB |
contestant found the optimal answer: 124074747024496432 == 124074747024496432 |
| 8 |
Correct |
1052 ms |
51904 KB |
contestant found the optimal answer: 309959349080800 == 309959349080800 |
| 9 |
Correct |
1118 ms |
58760 KB |
contestant found the optimal answer: 124113525649823701 == 124113525649823701 |
| 10 |
Correct |
1428 ms |
74552 KB |
contestant found the optimal answer: 124309619349406845 == 124309619349406845 |
