#include <iostream>
#include <vector>
#include <deque>
#include <stack>
#include <algorithm>
using namespace std;
const int N = 100005;
long long a[N];
struct Line {
long long a, b;
int idx;
long long GetCost(long long x) {
return a * x + b;
}
double Intersect(const Line& l) {
return (double)(b - l.b) / (l.a - a);
}
};
bool Check(Line& l1, Line& l2, Line& l3) {
return (l3.b - l2.b) * (l1.a - l2.a) <= (l2.b - l1.b) * (l2.a - l3.a);
}
int main() {
int n, k;
cin >> n >> k;
for (int i = 0; i < n; i++) {
cin >> a[i];
}
vector<long long> sums(n + 1);
for (int i = 0; i < n; i++) {
sums[i + 1] = sums[i] + a[i];
}
vector<long long> dp1(n + 1);
vector<long long> dp2(n + 1);
vector<vector<int>> splits(k + 1, vector<int>(n + 1));
for (int i = 1; i <= k; i++) {
deque<Line> lines;
lines.push_back({sums[i], dp1[i] - sums[i] * sums[i], i});
for (int j = i + 1; j <= n; j++) {
while (lines.size() > 1 && lines[0].GetCost(sums[j]) <= lines[1].GetCost(sums[j])) {
lines.pop_front();
}
dp2[j] = lines[0].GetCost(sums[j]);
splits[i][j] = lines[0].idx;
Line l({sums[j], dp1[j] - sums[j] * sums[j], j});
// while (lines.size() > 1 && lines[lines.size() - 2].Intersect(lines.back()) >= lines.back().Intersect(l)) {
// lines.pop_back();
// }
while (lines.size() > 1 && Check(lines[lines.size() - 2], lines.back(), l)) {
lines.pop_back();
}
lines.push_back(l);
}
dp1 = dp2;
}
cout << dp2[n] << endl;
stack<int> st;
for (int i = k, j = n; i > 0; i--) {
j = splits[i][j];
st.push(j);
}
while (!st.empty()) {
cout << st.top() << ' ';
st.pop();
}
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
384 KB |
contestant found the optimal answer: 108 == 108 |
| 2 |
Correct |
2 ms |
384 KB |
contestant found the optimal answer: 999 == 999 |
| 3 |
Correct |
3 ms |
384 KB |
contestant found the optimal answer: 0 == 0 |
| 4 |
Correct |
3 ms |
384 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 |
256 KB |
contestant found the optimal answer: 1 == 1 |
| 7 |
Correct |
2 ms |
384 KB |
contestant found the optimal answer: 1 == 1 |
| 8 |
Correct |
2 ms |
256 KB |
contestant found the optimal answer: 1 == 1 |
| 9 |
Correct |
3 ms |
384 KB |
contestant found the optimal answer: 100400096 == 100400096 |
| 10 |
Correct |
3 ms |
256 KB |
contestant found the optimal answer: 900320000 == 900320000 |
| 11 |
Correct |
2 ms |
256 KB |
contestant found the optimal answer: 3698080248 == 3698080248 |
| 12 |
Correct |
2 ms |
256 KB |
contestant found the optimal answer: 3200320000 == 3200320000 |
| 13 |
Correct |
3 ms |
256 KB |
contestant found the optimal answer: 140072 == 140072 |
| 14 |
Correct |
2 ms |
256 KB |
contestant found the optimal answer: 376041456 == 376041456 |
| 15 |
Correct |
3 ms |
256 KB |
contestant found the optimal answer: 805 == 805 |
| 16 |
Correct |
2 ms |
256 KB |
contestant found the optimal answer: 900189994 == 900189994 |
| 17 |
Correct |
2 ms |
384 KB |
contestant found the optimal answer: 999919994 == 999919994 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
384 KB |
contestant found the optimal answer: 1093956 == 1093956 |
| 2 |
Correct |
3 ms |
384 KB |
contestant found the optimal answer: 302460000 == 302460000 |
| 3 |
Correct |
3 ms |
384 KB |
contestant found the optimal answer: 122453454361 == 122453454361 |
| 4 |
Correct |
2 ms |
256 KB |
contestant found the optimal answer: 93663683509 == 93663683509 |
| 5 |
Correct |
2 ms |
384 KB |
contestant found the optimal answer: 1005304678 == 1005304678 |
| 6 |
Correct |
3 ms |
384 KB |
contestant found the optimal answer: 933702 == 933702 |
| 7 |
Correct |
2 ms |
384 KB |
contestant found the optimal answer: 25082842857 == 25082842857 |
| 8 |
Correct |
3 ms |
256 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 |
384 KB |
contestant found the optimal answer: 29000419931 == 29000419931 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
384 KB |
contestant found the optimal answer: 610590000 == 610590000 |
| 2 |
Correct |
2 ms |
304 KB |
contestant found the optimal answer: 311760000 == 311760000 |
| 3 |
Correct |
2 ms |
512 KB |
contestant found the optimal answer: 1989216017013 == 1989216017013 |
| 4 |
Correct |
2 ms |
384 KB |
contestant found the optimal answer: 1499437552673 == 1499437552673 |
| 5 |
Correct |
3 ms |
384 KB |
contestant found the optimal answer: 1019625819 == 1019625819 |
| 6 |
Correct |
3 ms |
512 KB |
contestant found the optimal answer: 107630884 == 107630884 |
| 7 |
Correct |
3 ms |
512 KB |
contestant found the optimal answer: 475357671774 == 475357671774 |
| 8 |
Correct |
3 ms |
384 KB |
contestant found the optimal answer: 193556962 == 193556962 |
| 9 |
Correct |
3 ms |
384 KB |
contestant found the optimal answer: 482389919803 == 482389919803 |
| 10 |
Correct |
3 ms |
384 KB |
contestant found the optimal answer: 490686959791 == 490686959791 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
3 ms |
384 KB |
contestant found the optimal answer: 21503404 == 21503404 |
| 2 |
Correct |
2 ms |
384 KB |
contestant found the optimal answer: 140412195 == 140412195 |
| 3 |
Correct |
12 ms |
1152 KB |
contestant found the optimal answer: 49729674225461 == 49729674225461 |
| 4 |
Correct |
2 ms |
384 KB |
contestant found the optimal answer: 37485571387523 == 37485571387523 |
| 5 |
Correct |
9 ms |
1152 KB |
contestant found the optimal answer: 679388326 == 679388326 |
| 6 |
Correct |
11 ms |
1024 KB |
contestant found the optimal answer: 4699030287 == 4699030287 |
| 7 |
Correct |
10 ms |
1152 KB |
contestant found the optimal answer: 12418819758185 == 12418819758185 |
| 8 |
Correct |
8 ms |
1152 KB |
contestant found the optimal answer: 31093317350 == 31093317350 |
| 9 |
Correct |
4 ms |
512 KB |
contestant found the optimal answer: 12194625429236 == 12194625429236 |
| 10 |
Correct |
6 ms |
768 KB |
contestant found the optimal answer: 12345131038664 == 12345131038664 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
6 ms |
896 KB |
contestant found the optimal answer: 1818678304 == 1818678304 |
| 2 |
Correct |
5 ms |
1024 KB |
contestant found the optimal answer: 1326260195 == 1326260195 |
| 3 |
Correct |
64 ms |
8600 KB |
contestant found the optimal answer: 4973126687469639 == 4973126687469639 |
| 4 |
Correct |
9 ms |
896 KB |
contestant found the optimal answer: 3748491676694116 == 3748491676694116 |
| 5 |
Correct |
65 ms |
5632 KB |
contestant found the optimal answer: 1085432199 == 1085432199 |
| 6 |
Correct |
65 ms |
6272 KB |
contestant found the optimal answer: 514790755404 == 514790755404 |
| 7 |
Correct |
76 ms |
6656 KB |
contestant found the optimal answer: 1256105310476641 == 1256105310476641 |
| 8 |
Correct |
60 ms |
5752 KB |
contestant found the optimal answer: 3099592898816 == 3099592898816 |
| 9 |
Correct |
56 ms |
6272 KB |
contestant found the optimal answer: 1241131419367412 == 1241131419367412 |
| 10 |
Correct |
87 ms |
7916 KB |
contestant found the optimal answer: 1243084101967798 == 1243084101967798 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
39 ms |
6000 KB |
contestant found the optimal answer: 19795776960 == 19795776960 |
| 2 |
Correct |
37 ms |
6136 KB |
contestant found the optimal answer: 19874432173 == 19874432173 |
| 3 |
Correct |
754 ms |
83568 KB |
contestant found the optimal answer: 497313449256899208 == 497313449256899208 |
| 4 |
Correct |
53 ms |
6896 KB |
contestant found the optimal answer: 374850090734572421 == 374850090734572421 |
| 5 |
Correct |
900 ms |
83780 KB |
contestant found the optimal answer: 36183271951 == 36183271951 |
| 6 |
Correct |
617 ms |
60016 KB |
contestant found the optimal answer: 51629847150471 == 51629847150471 |
| 7 |
Correct |
660 ms |
64624 KB |
contestant found the optimal answer: 124074747024496432 == 124074747024496432 |
| 8 |
Correct |
580 ms |
53360 KB |
contestant found the optimal answer: 309959349080800 == 309959349080800 |
| 9 |
Correct |
606 ms |
60400 KB |
contestant found the optimal answer: 124113525649823701 == 124113525649823701 |
| 10 |
Correct |
828 ms |
76016 KB |
contestant found the optimal answer: 124309619349406845 == 124309619349406845 |
