#include <iostream>
#include <vector>
using namespace std;
using ll = long long;
const int MAXN = 1e5 + 123;
const int MAXK = 200;
const ll INF = 1e18 + 177013;
int a[MAXN];
int opt[MAXK][MAXN];
ll dp[MAXN];
ll ndp[MAXN];
ll sm[MAXN];
ll divup(ll a, ll m) {
return (a + m - 1) / m;
}
struct line {
ll b;
ll k;
int i;
line(ll b_, ll k_, int i_): b(b_), k(k_), i(i_) {}
ll operator()(ll x) {
return k * x + b;
}
ll where_better(line l) {
if (k == l.k) {
if (b <= l.b)
return 0;
else
return INF;
}
return divup(b - l.b, l.k - k);
}
};
void back_track(int i, int lyr) {
if (lyr == 0) {
cout << opt[lyr][i] + 1 << ' ';
return;
}
back_track(opt[lyr][i], lyr - 1);
cout << opt[lyr][i] + 1 << ' ';
}
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
int n, k;
cin >> n >> k;
for (int i = 0; i < n; ++i)
cin >> a[i];
for (int i = 0; i < n; ++i) {
sm[i] += a[i];
if (i)
sm[i] += sm[i - 1];
dp[i] = 1ll * sm[i] * sm[i];
}
for (int lyr = 0; lyr < k; ++lyr) {
vector<pair<ll, line>> cht;
cht.push_back({0, {0, 0, -1}});
int j = 0;
for (int i = 0; i < n; ++i) {
j = min(j, int(cht.size()) - 1);
//j = 0;
while (j + 1 < cht.size() && sm[i] >= cht[j + 1].first)
++j;
ndp[i] = cht[j].second(sm[i]) + 1ll * sm[i] * sm[i];
opt[lyr][i] = cht[j].second.i;
line l(dp[i] + 1ll * sm[i] * sm[i], -2ll * sm[i], i);
while (true) {
if (cht.empty()) {
cht.push_back({0, l});
break;
}
ll x = l.where_better(cht.back().second);
if (x <= cht.back().first) {
cht.pop_back();
} else {
cht.push_back({x, l});
break;
}
}
}
for (int i = 0; i < n; ++i) {
dp[i] = min(dp[i], ndp[i]);
}
}
cout << (1ll * sm[n - 1] * sm[n - 1] - dp[n - 1]) / 2 << endl;;
back_track(n - 1, k - 1);
}
Compilation message
sequence.cpp: In function 'int main()':
sequence.cpp:72:26: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<long long int, line> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
72 | while (j + 1 < cht.size() && sm[i] >= cht[j + 1].first)
| ~~~~~~^~~~~~~~~~~~
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
340 KB |
contestant found the optimal answer: 108 == 108 |
| 2 |
Correct |
0 ms |
340 KB |
contestant found the optimal answer: 999 == 999 |
| 3 |
Correct |
0 ms |
340 KB |
contestant found the optimal answer: 0 == 0 |
| 4 |
Correct |
0 ms |
340 KB |
contestant found the optimal answer: 1542524 == 1542524 |
| 5 |
Correct |
0 ms |
340 KB |
contestant found the optimal answer: 4500000000 == 4500000000 |
| 6 |
Correct |
0 ms |
340 KB |
contestant found the optimal answer: 1 == 1 |
| 7 |
Correct |
0 ms |
340 KB |
contestant found the optimal answer: 1 == 1 |
| 8 |
Correct |
0 ms |
340 KB |
contestant found the optimal answer: 1 == 1 |
| 9 |
Correct |
0 ms |
340 KB |
contestant found the optimal answer: 100400096 == 100400096 |
| 10 |
Correct |
0 ms |
340 KB |
contestant found the optimal answer: 900320000 == 900320000 |
| 11 |
Correct |
0 ms |
340 KB |
contestant found the optimal answer: 3698080248 == 3698080248 |
| 12 |
Correct |
0 ms |
340 KB |
contestant found the optimal answer: 3200320000 == 3200320000 |
| 13 |
Correct |
0 ms |
340 KB |
contestant found the optimal answer: 140072 == 140072 |
| 14 |
Correct |
0 ms |
340 KB |
contestant found the optimal answer: 376041456 == 376041456 |
| 15 |
Correct |
0 ms |
340 KB |
contestant found the optimal answer: 805 == 805 |
| 16 |
Correct |
0 ms |
340 KB |
contestant found the optimal answer: 900189994 == 900189994 |
| 17 |
Correct |
0 ms |
340 KB |
contestant found the optimal answer: 999919994 == 999919994 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
340 KB |
contestant found the optimal answer: 1093956 == 1093956 |
| 2 |
Correct |
1 ms |
340 KB |
contestant found the optimal answer: 302460000 == 302460000 |
| 3 |
Correct |
1 ms |
596 KB |
contestant found the optimal answer: 122453454361 == 122453454361 |
| 4 |
Correct |
1 ms |
340 KB |
contestant found the optimal answer: 93663683509 == 93663683509 |
| 5 |
Correct |
1 ms |
340 KB |
contestant found the optimal answer: 1005304678 == 1005304678 |
| 6 |
Correct |
1 ms |
340 KB |
contestant found the optimal answer: 933702 == 933702 |
| 7 |
Correct |
1 ms |
468 KB |
contestant found the optimal answer: 25082842857 == 25082842857 |
| 8 |
Correct |
1 ms |
340 KB |
contestant found the optimal answer: 687136 == 687136 |
| 9 |
Correct |
0 ms |
340 KB |
contestant found the optimal answer: 27295930079 == 27295930079 |
| 10 |
Correct |
1 ms |
340 KB |
contestant found the optimal answer: 29000419931 == 29000419931 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
340 KB |
contestant found the optimal answer: 610590000 == 610590000 |
| 2 |
Correct |
0 ms |
340 KB |
contestant found the optimal answer: 311760000 == 311760000 |
| 3 |
Correct |
2 ms |
1364 KB |
contestant found the optimal answer: 1989216017013 == 1989216017013 |
| 4 |
Correct |
1 ms |
340 KB |
contestant found the optimal answer: 1499437552673 == 1499437552673 |
| 5 |
Correct |
1 ms |
1108 KB |
contestant found the optimal answer: 1019625819 == 1019625819 |
| 6 |
Correct |
2 ms |
1236 KB |
contestant found the optimal answer: 107630884 == 107630884 |
| 7 |
Correct |
2 ms |
1364 KB |
contestant found the optimal answer: 475357671774 == 475357671774 |
| 8 |
Correct |
1 ms |
596 KB |
contestant found the optimal answer: 193556962 == 193556962 |
| 9 |
Correct |
1 ms |
468 KB |
contestant found the optimal answer: 482389919803 == 482389919803 |
| 10 |
Correct |
1 ms |
596 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 |
2132 KB |
contestant found the optimal answer: 49729674225461 == 49729674225461 |
| 4 |
Correct |
1 ms |
340 KB |
contestant found the optimal answer: 37485571387523 == 37485571387523 |
| 5 |
Correct |
6 ms |
2132 KB |
contestant found the optimal answer: 679388326 == 679388326 |
| 6 |
Correct |
6 ms |
1876 KB |
contestant found the optimal answer: 4699030287 == 4699030287 |
| 7 |
Correct |
6 ms |
2112 KB |
contestant found the optimal answer: 12418819758185 == 12418819758185 |
| 8 |
Correct |
5 ms |
2132 KB |
contestant found the optimal answer: 31093317350 == 31093317350 |
| 9 |
Correct |
2 ms |
724 KB |
contestant found the optimal answer: 12194625429236 == 12194625429236 |
| 10 |
Correct |
2 ms |
1108 KB |
contestant found the optimal answer: 12345131038664 == 12345131038664 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
1128 KB |
contestant found the optimal answer: 1818678304 == 1818678304 |
| 2 |
Correct |
2 ms |
1184 KB |
contestant found the optimal answer: 1326260195 == 1326260195 |
| 3 |
Correct |
89 ms |
10176 KB |
contestant found the optimal answer: 4973126687469639 == 4973126687469639 |
| 4 |
Correct |
4 ms |
1632 KB |
contestant found the optimal answer: 3748491676694116 == 3748491676694116 |
| 5 |
Correct |
49 ms |
6236 KB |
contestant found the optimal answer: 1085432199 == 1085432199 |
| 6 |
Correct |
63 ms |
7072 KB |
contestant found the optimal answer: 514790755404 == 514790755404 |
| 7 |
Correct |
73 ms |
8228 KB |
contestant found the optimal answer: 1256105310476641 == 1256105310476641 |
| 8 |
Correct |
54 ms |
6952 KB |
contestant found the optimal answer: 3099592898816 == 3099592898816 |
| 9 |
Correct |
62 ms |
7704 KB |
contestant found the optimal answer: 1241131419367412 == 1241131419367412 |
| 10 |
Correct |
80 ms |
9408 KB |
contestant found the optimal answer: 1243084101967798 == 1243084101967798 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
22 ms |
10768 KB |
contestant found the optimal answer: 19795776960 == 19795776960 |
| 2 |
Correct |
23 ms |
10856 KB |
contestant found the optimal answer: 19874432173 == 19874432173 |
| 3 |
Correct |
1048 ms |
89224 KB |
contestant found the optimal answer: 497313449256899208 == 497313449256899208 |
| 4 |
Correct |
27 ms |
12000 KB |
contestant found the optimal answer: 374850090734572421 == 374850090734572421 |
| 5 |
Correct |
1012 ms |
88132 KB |
contestant found the optimal answer: 36183271951 == 36183271951 |
| 6 |
Correct |
431 ms |
62140 KB |
contestant found the optimal answer: 51629847150471 == 51629847150471 |
| 7 |
Correct |
789 ms |
69604 KB |
contestant found the optimal answer: 124074747024496432 == 124074747024496432 |
| 8 |
Correct |
631 ms |
58348 KB |
contestant found the optimal answer: 309959349080800 == 309959349080800 |
| 9 |
Correct |
759 ms |
65224 KB |
contestant found the optimal answer: 124113525649823701 == 124113525649823701 |
| 10 |
Correct |
960 ms |
80864 KB |
contestant found the optimal answer: 124309619349406845 == 124309619349406845 |
