#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int N = 1e5 + 5, K = 205;
struct Line {
int id;
ll a, b;
Line(int _id, ll _a, ll _b): id(_id), a(_a), b(_b) {}
ll calc(ll x) {
return a * x + b;
}
};
int n, k, a[N], trace[N][K];
ll sum[N], dp[N], pre[N];
vector<Line> dq;
bool overlap(const Line &p1, const Line &p2, const Line &p3) {
return (p2.a - p1.a) * (p1.b - p3.b) <= (p3.a - p1.a) * (p1.b - p2.b);
}
int main() {
ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);
cin >> n >> k;
for (int i = 1; i <= n; ++i) {
cin >> a[i];
sum[i] = sum[i - 1] + a[i];
}
for (int j = 1; j <= k; ++j) {
int seen = 0;
dq.clear();
fill(dp + 1, dp + 1 + n, 0);
for (int i = 1; i <= n; ++i) {
while (seen + 1 < (int)dq.size() && dq[seen].calc(sum[i]) <= dq[seen + 1].calc(sum[i])) ++seen;
if (seen < (int)dq.size()) {
dp[i] = dq[seen].calc(sum[i]);
trace[i][j] = dq[seen].id;
}
Line newLine = Line(i, sum[i], pre[i] - sum[i] * sum[i]);
pre[i] = dp[i];
while (dq.size() > 1 && overlap(dq[(int)dq.size() - 2], dq.back(), newLine)) dq.pop_back();
if (!dq.empty() && dq.back().a == newLine.a) {
if (dq.back().b <= newLine.b) {
dq.pop_back();
dq.push_back(newLine);
}
} else {
dq.push_back(newLine);
}
}
}
vector<int> pos;
int cur = n;
while (k) pos.emplace_back(cur = trace[cur][k--]);
reverse(pos.begin(), pos.end());
cout << dp[n] << "\n";
for (int x: pos) cout << x << " ";
return 0;
}
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
5 ms |
376 KB |
contestant found the optimal answer: 108 == 108 |
| 2 |
Correct |
5 ms |
376 KB |
contestant found the optimal answer: 999 == 999 |
| 3 |
Correct |
5 ms |
376 KB |
contestant found the optimal answer: 0 == 0 |
| 4 |
Correct |
5 ms |
376 KB |
contestant found the optimal answer: 1542524 == 1542524 |
| 5 |
Correct |
5 ms |
376 KB |
contestant found the optimal answer: 4500000000 == 4500000000 |
| 6 |
Correct |
5 ms |
376 KB |
contestant found the optimal answer: 1 == 1 |
| 7 |
Correct |
5 ms |
376 KB |
contestant found the optimal answer: 1 == 1 |
| 8 |
Correct |
5 ms |
248 KB |
contestant found the optimal answer: 1 == 1 |
| 9 |
Correct |
5 ms |
376 KB |
contestant found the optimal answer: 100400096 == 100400096 |
| 10 |
Correct |
5 ms |
376 KB |
contestant found the optimal answer: 900320000 == 900320000 |
| 11 |
Correct |
5 ms |
380 KB |
contestant found the optimal answer: 3698080248 == 3698080248 |
| 12 |
Correct |
5 ms |
376 KB |
contestant found the optimal answer: 3200320000 == 3200320000 |
| 13 |
Correct |
5 ms |
376 KB |
contestant found the optimal answer: 140072 == 140072 |
| 14 |
Correct |
5 ms |
376 KB |
contestant found the optimal answer: 376041456 == 376041456 |
| 15 |
Correct |
5 ms |
376 KB |
contestant found the optimal answer: 805 == 805 |
| 16 |
Correct |
5 ms |
376 KB |
contestant found the optimal answer: 900189994 == 900189994 |
| 17 |
Correct |
5 ms |
376 KB |
contestant found the optimal answer: 999919994 == 999919994 |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
5 ms |
376 KB |
contestant found the optimal answer: 1093956 == 1093956 |
| 2 |
Correct |
5 ms |
376 KB |
contestant found the optimal answer: 302460000 == 302460000 |
| 3 |
Correct |
5 ms |
376 KB |
contestant found the optimal answer: 122453454361 == 122453454361 |
| 4 |
Correct |
5 ms |
376 KB |
contestant found the optimal answer: 93663683509 == 93663683509 |
| 5 |
Correct |
5 ms |
380 KB |
contestant found the optimal answer: 1005304678 == 1005304678 |
| 6 |
Correct |
5 ms |
376 KB |
contestant found the optimal answer: 933702 == 933702 |
| 7 |
Correct |
5 ms |
376 KB |
contestant found the optimal answer: 25082842857 == 25082842857 |
| 8 |
Correct |
5 ms |
376 KB |
contestant found the optimal answer: 687136 == 687136 |
| 9 |
Correct |
5 ms |
376 KB |
contestant found the optimal answer: 27295930079 == 27295930079 |
| 10 |
Correct |
5 ms |
376 KB |
contestant found the optimal answer: 29000419931 == 29000419931 |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
5 ms |
508 KB |
contestant found the optimal answer: 610590000 == 610590000 |
| 2 |
Correct |
5 ms |
504 KB |
contestant found the optimal answer: 311760000 == 311760000 |
| 3 |
Correct |
6 ms |
504 KB |
contestant found the optimal answer: 1989216017013 == 1989216017013 |
| 4 |
Correct |
5 ms |
504 KB |
contestant found the optimal answer: 1499437552673 == 1499437552673 |
| 5 |
Correct |
5 ms |
504 KB |
contestant found the optimal answer: 1019625819 == 1019625819 |
| 6 |
Correct |
5 ms |
504 KB |
contestant found the optimal answer: 107630884 == 107630884 |
| 7 |
Correct |
6 ms |
504 KB |
contestant found the optimal answer: 475357671774 == 475357671774 |
| 8 |
Correct |
5 ms |
504 KB |
contestant found the optimal answer: 193556962 == 193556962 |
| 9 |
Correct |
5 ms |
504 KB |
contestant found the optimal answer: 482389919803 == 482389919803 |
| 10 |
Correct |
5 ms |
504 KB |
contestant found the optimal answer: 490686959791 == 490686959791 |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
5 ms |
1272 KB |
contestant found the optimal answer: 21503404 == 21503404 |
| 2 |
Correct |
5 ms |
1272 KB |
contestant found the optimal answer: 140412195 == 140412195 |
| 3 |
Correct |
8 ms |
1272 KB |
contestant found the optimal answer: 49729674225461 == 49729674225461 |
| 4 |
Correct |
5 ms |
1272 KB |
contestant found the optimal answer: 37485571387523 == 37485571387523 |
| 5 |
Correct |
9 ms |
1272 KB |
contestant found the optimal answer: 679388326 == 679388326 |
| 6 |
Correct |
10 ms |
1272 KB |
contestant found the optimal answer: 4699030287 == 4699030287 |
| 7 |
Correct |
9 ms |
1272 KB |
contestant found the optimal answer: 12418819758185 == 12418819758185 |
| 8 |
Correct |
8 ms |
1272 KB |
contestant found the optimal answer: 31093317350 == 31093317350 |
| 9 |
Correct |
6 ms |
1272 KB |
contestant found the optimal answer: 12194625429236 == 12194625429236 |
| 10 |
Correct |
7 ms |
1272 KB |
contestant found the optimal answer: 12345131038664 == 12345131038664 |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
11 ms |
9016 KB |
contestant found the optimal answer: 1818678304 == 1818678304 |
| 2 |
Correct |
10 ms |
9016 KB |
contestant found the optimal answer: 1326260195 == 1326260195 |
| 3 |
Correct |
41 ms |
9076 KB |
contestant found the optimal answer: 4973126687469639 == 4973126687469639 |
| 4 |
Correct |
11 ms |
9076 KB |
contestant found the optimal answer: 3748491676694116 == 3748491676694116 |
| 5 |
Correct |
38 ms |
9016 KB |
contestant found the optimal answer: 1085432199 == 1085432199 |
| 6 |
Correct |
38 ms |
9020 KB |
contestant found the optimal answer: 514790755404 == 514790755404 |
| 7 |
Correct |
40 ms |
9072 KB |
contestant found the optimal answer: 1256105310476641 == 1256105310476641 |
| 8 |
Correct |
30 ms |
9076 KB |
contestant found the optimal answer: 3099592898816 == 3099592898816 |
| 9 |
Correct |
35 ms |
8944 KB |
contestant found the optimal answer: 1241131419367412 == 1241131419367412 |
| 10 |
Correct |
45 ms |
8948 KB |
contestant found the optimal answer: 1243084101967798 == 1243084101967798 |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
63 ms |
85344 KB |
contestant found the optimal answer: 19795776960 == 19795776960 |
| 2 |
Correct |
61 ms |
85348 KB |
contestant found the optimal answer: 19874432173 == 19874432173 |
| 3 |
Correct |
606 ms |
85732 KB |
contestant found the optimal answer: 497313449256899208 == 497313449256899208 |
| 4 |
Correct |
63 ms |
85860 KB |
contestant found the optimal answer: 374850090734572421 == 374850090734572421 |
| 5 |
Correct |
624 ms |
85348 KB |
contestant found the optimal answer: 36183271951 == 36183271951 |
| 6 |
Correct |
467 ms |
85348 KB |
contestant found the optimal answer: 51629847150471 == 51629847150471 |
| 7 |
Correct |
473 ms |
85732 KB |
contestant found the optimal answer: 124074747024496432 == 124074747024496432 |
| 8 |
Correct |
384 ms |
85856 KB |
contestant found the optimal answer: 309959349080800 == 309959349080800 |
| 9 |
Correct |
433 ms |
85600 KB |
contestant found the optimal answer: 124113525649823701 == 124113525649823701 |
| 10 |
Correct |
579 ms |
85604 KB |
contestant found the optimal answer: 124309619349406845 == 124309619349406845 |
