#include <bits/stdc++.h>
using namespace std;
struct Line {
long long m, b;
Line(long long _m, long long _b) : m(_m), b(_b) {}
long long operator()(long long x) { return m * x + b; }
friend long double intersect(const Line &l1, const Line &l2) {
return (long double)(l2.b - l1.b) / (long double)(l1.m - l2.m);
}
friend ostream& operator<<(ostream &os, const Line &l) {
return os << '{' << l.m << "x + " << l.b << '}';
}
};
int main() {
int N, K;
cin >> N >> K;
vector<long long> A(N + 1), P(N + 1, 0);
for (int i = 1; i <= N; i++) {
cin >> A[i];
P[i] = P[i - 1] + A[i];
}
array<vector<long long>, 2> dp;
dp[0].assign(N + 1, 0), dp[1].assign(N + 1, 0);
vector<vector<int>> par(K + 2, vector<int>(N + 1, 0));
for (int k = 1; k <= K + 1; k++) {
deque<pair<Line, int>> dq;
for (int i = 1; i <= N; i++) {
Line l(P[i - 1], dp[0][i - 1] - P[i - 1] * P[N]);
while (dq.size() >= 2 && intersect(l, dq[dq.size() - 2].first) >= intersect(l, dq[dq.size() - 1].first))
dq.pop_back();
dq.emplace_back(move(l), i - 1);
while (dq.size() >= 2 && dq[0].first(P[i]) <= dq[1].first(P[i]))
dq.pop_front();
dp[1][i] = dq[0].first(P[i]) + P[i] * P[N] - P[i] * P[i];
par[k][i] = dq[0].second;
}
copy(dp[1].begin(), dp[1].end(), dp[0].begin());
}
cout << dp[0][N] << '\n';
vector<int> ans;
for (int k = K + 1, c = N; k > 0; k--) {
if (c != N)
ans.push_back(c);
c = par[k][c];
}
reverse(ans.begin(), ans.end());
for (int c : ans)
cout << c << ' ';
cout << '\n';
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
212 KB |
contestant found the optimal answer: 108 == 108 |
2 |
Correct |
0 ms |
212 KB |
contestant found the optimal answer: 999 == 999 |
3 |
Correct |
1 ms |
212 KB |
contestant found the optimal answer: 0 == 0 |
4 |
Correct |
1 ms |
212 KB |
contestant found the optimal answer: 1542524 == 1542524 |
5 |
Correct |
1 ms |
300 KB |
contestant found the optimal answer: 4500000000 == 4500000000 |
6 |
Correct |
0 ms |
212 KB |
contestant found the optimal answer: 1 == 1 |
7 |
Correct |
1 ms |
300 KB |
contestant found the optimal answer: 1 == 1 |
8 |
Correct |
1 ms |
212 KB |
contestant found the optimal answer: 1 == 1 |
9 |
Correct |
1 ms |
212 KB |
contestant found the optimal answer: 100400096 == 100400096 |
10 |
Correct |
1 ms |
212 KB |
contestant found the optimal answer: 900320000 == 900320000 |
11 |
Correct |
1 ms |
212 KB |
contestant found the optimal answer: 3698080248 == 3698080248 |
12 |
Correct |
1 ms |
212 KB |
contestant found the optimal answer: 3200320000 == 3200320000 |
13 |
Correct |
1 ms |
296 KB |
contestant found the optimal answer: 140072 == 140072 |
14 |
Correct |
0 ms |
212 KB |
contestant found the optimal answer: 376041456 == 376041456 |
15 |
Correct |
1 ms |
212 KB |
contestant found the optimal answer: 805 == 805 |
16 |
Correct |
1 ms |
300 KB |
contestant found the optimal answer: 900189994 == 900189994 |
17 |
Correct |
1 ms |
212 KB |
contestant found the optimal answer: 999919994 == 999919994 |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
212 KB |
contestant found the optimal answer: 1093956 == 1093956 |
2 |
Correct |
0 ms |
212 KB |
contestant found the optimal answer: 302460000 == 302460000 |
3 |
Correct |
1 ms |
212 KB |
contestant found the optimal answer: 122453454361 == 122453454361 |
4 |
Correct |
0 ms |
212 KB |
contestant found the optimal answer: 93663683509 == 93663683509 |
5 |
Correct |
1 ms |
212 KB |
contestant found the optimal answer: 1005304678 == 1005304678 |
6 |
Correct |
0 ms |
212 KB |
contestant found the optimal answer: 933702 == 933702 |
7 |
Correct |
1 ms |
212 KB |
contestant found the optimal answer: 25082842857 == 25082842857 |
8 |
Correct |
0 ms |
212 KB |
contestant found the optimal answer: 687136 == 687136 |
9 |
Correct |
1 ms |
212 KB |
contestant found the optimal answer: 27295930079 == 27295930079 |
10 |
Correct |
0 ms |
212 KB |
contestant found the optimal answer: 29000419931 == 29000419931 |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
212 KB |
contestant found the optimal answer: 610590000 == 610590000 |
2 |
Correct |
0 ms |
212 KB |
contestant found the optimal answer: 311760000 == 311760000 |
3 |
Correct |
1 ms |
468 KB |
contestant found the optimal answer: 1989216017013 == 1989216017013 |
4 |
Correct |
1 ms |
212 KB |
contestant found the optimal answer: 1499437552673 == 1499437552673 |
5 |
Correct |
1 ms |
340 KB |
contestant found the optimal answer: 1019625819 == 1019625819 |
6 |
Correct |
2 ms |
468 KB |
contestant found the optimal answer: 107630884 == 107630884 |
7 |
Correct |
1 ms |
468 KB |
contestant found the optimal answer: 475357671774 == 475357671774 |
8 |
Correct |
1 ms |
300 KB |
contestant found the optimal answer: 193556962 == 193556962 |
9 |
Correct |
1 ms |
300 KB |
contestant found the optimal answer: 482389919803 == 482389919803 |
10 |
Correct |
1 ms |
340 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 |
6 ms |
1072 KB |
contestant found the optimal answer: 49729674225461 == 49729674225461 |
4 |
Correct |
1 ms |
340 KB |
contestant found the optimal answer: 37485571387523 == 37485571387523 |
5 |
Correct |
7 ms |
1108 KB |
contestant found the optimal answer: 679388326 == 679388326 |
6 |
Correct |
7 ms |
948 KB |
contestant found the optimal answer: 4699030287 == 4699030287 |
7 |
Correct |
8 ms |
1108 KB |
contestant found the optimal answer: 12418819758185 == 12418819758185 |
8 |
Correct |
7 ms |
1108 KB |
contestant found the optimal answer: 31093317350 == 31093317350 |
9 |
Correct |
3 ms |
468 KB |
contestant found the optimal answer: 12194625429236 == 12194625429236 |
10 |
Correct |
4 ms |
596 KB |
contestant found the optimal answer: 12345131038664 == 12345131038664 |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
4 ms |
852 KB |
contestant found the optimal answer: 1818678304 == 1818678304 |
2 |
Correct |
3 ms |
980 KB |
contestant found the optimal answer: 1326260195 == 1326260195 |
3 |
Correct |
68 ms |
8660 KB |
contestant found the optimal answer: 4973126687469639 == 4973126687469639 |
4 |
Correct |
4 ms |
888 KB |
contestant found the optimal answer: 3748491676694116 == 3748491676694116 |
5 |
Correct |
53 ms |
5588 KB |
contestant found the optimal answer: 1085432199 == 1085432199 |
6 |
Correct |
66 ms |
6300 KB |
contestant found the optimal answer: 514790755404 == 514790755404 |
7 |
Correct |
62 ms |
6612 KB |
contestant found the optimal answer: 1256105310476641 == 1256105310476641 |
8 |
Correct |
45 ms |
5588 KB |
contestant found the optimal answer: 3099592898816 == 3099592898816 |
9 |
Correct |
54 ms |
6204 KB |
contestant found the optimal answer: 1241131419367412 == 1241131419367412 |
10 |
Correct |
68 ms |
7764 KB |
contestant found the optimal answer: 1243084101967798 == 1243084101967798 |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
30 ms |
6348 KB |
contestant found the optimal answer: 19795776960 == 19795776960 |
2 |
Correct |
31 ms |
6732 KB |
contestant found the optimal answer: 19874432173 == 19874432173 |
3 |
Correct |
656 ms |
84440 KB |
contestant found the optimal answer: 497313449256899208 == 497313449256899208 |
4 |
Correct |
37 ms |
7108 KB |
contestant found the optimal answer: 374850090734572421 == 374850090734572421 |
5 |
Correct |
848 ms |
84108 KB |
contestant found the optimal answer: 36183271951 == 36183271951 |
6 |
Correct |
604 ms |
60356 KB |
contestant found the optimal answer: 51629847150471 == 51629847150471 |
7 |
Correct |
599 ms |
64808 KB |
contestant found the optimal answer: 124074747024496432 == 124074747024496432 |
8 |
Correct |
469 ms |
53700 KB |
contestant found the optimal answer: 309959349080800 == 309959349080800 |
9 |
Correct |
519 ms |
60612 KB |
contestant found the optimal answer: 124113525649823701 == 124113525649823701 |
10 |
Correct |
665 ms |
76248 KB |
contestant found the optimal answer: 124309619349406845 == 124309619349406845 |