#include <iostream>
#include <iomanip>
#include <cstdio>
#include <vector>
#include <algorithm>
#include <cmath>
#include <cstring>
#include <cassert>
#include <string>
#include <set>
#include <map>
#include <random>
#include <bitset>
#include <string>
#include <unordered_set>
#include <unordered_map>
#include <deque>
#include <queue>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
using namespace std;
using ll = long long;
using ul = unsigned long long;
using ld = long double;
const int N = 100001, K = 202;
int pr[K][N];
ll cd[N], ps[N], nd[N];
ll f(pair<ll, ll> q, ll x) {
return q.first * x + q.second;
}
bool td(pair<ll, ll> p1, pair<ll, ll> p2, pair<ll, ll> p3) {
return (p2.second - p1.second) * (p1.first - p3.first) >= (p3.second - p1.second) * (p1.first - p2.first) &&
(p3.second - p1.second) * (p2.first - p3.first) >= (p3.second - p2.second) * (p1.first - p3.first);
}
int main() {
ios_base::sync_with_stdio(0); cin.tie(0);
ll n, k, x;
cin >> n >> k;
ll ans = 0;
vector<ll> a;
rep(i, n) {
cin >> x;
// if (x)
a.push_back(x);
}
n = a.size();
k = min(k, n - 1);
rep(i, n) {
ps[i + 1] = ps[i] + a[i];
cd[i + 1] = 1e18;
}
rep(i, k + 1) {
vector<pair<ll, ll>> dp;
vector<int> num;
ll pos = 0;
rep(j, n) {
pair<ll, ll> np = {-2 * ps[j], cd[j] + ps[j] * ps[j]};
while (dp.size() > 1 && td(dp[dp.size() - 2], dp.back(), np)) {
dp.pop_back();
num.pop_back();
}
pos = min(pos, (ll) dp.size() - 1);
dp.push_back(np);
num.push_back(j);
while (pos + 1 < dp.size() && f(dp[pos + 1], ps[j + 1]) <= f(dp[pos], ps[j + 1]))
pos++;
nd[j + 1] = ps[j + 1] * ps[j + 1] + f(dp[pos], ps[j + 1]);
pr[i][j + 1] = num[pos];
}
rep(j, n + 1)
cd[j] = nd[j];
}
cout << (ps[n] * ps[n] - cd[n]) / 2 << '\n';
int cp = n;
for (int i = k; i > 0; i--) {
cp = pr[i][cp];
cout << cp << ' ';
}
}
Compilation message
sequence.cpp: In function 'int main()':
sequence.cpp:71:28: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
while (pos + 1 < dp.size() && f(dp[pos + 1], ps[j + 1]) <= f(dp[pos], ps[j + 1]))
~~~~~~~~^~~~~~~~~~~
sequence.cpp:45:8: warning: unused variable 'ans' [-Wunused-variable]
ll ans = 0;
^~~
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
384 KB |
contestant found the optimal answer: 108 == 108 |
| 2 |
Correct |
0 ms |
384 KB |
contestant found the optimal answer: 999 == 999 |
| 3 |
Correct |
0 ms |
384 KB |
contestant found the optimal answer: 0 == 0 |
| 4 |
Correct |
0 ms |
384 KB |
contestant found the optimal answer: 1542524 == 1542524 |
| 5 |
Correct |
0 ms |
384 KB |
contestant found the optimal answer: 4500000000 == 4500000000 |
| 6 |
Correct |
0 ms |
384 KB |
contestant found the optimal answer: 1 == 1 |
| 7 |
Correct |
0 ms |
384 KB |
contestant found the optimal answer: 1 == 1 |
| 8 |
Correct |
0 ms |
384 KB |
contestant found the optimal answer: 1 == 1 |
| 9 |
Correct |
0 ms |
384 KB |
contestant found the optimal answer: 100400096 == 100400096 |
| 10 |
Correct |
0 ms |
384 KB |
contestant found the optimal answer: 900320000 == 900320000 |
| 11 |
Correct |
0 ms |
384 KB |
contestant found the optimal answer: 3698080248 == 3698080248 |
| 12 |
Correct |
1 ms |
384 KB |
contestant found the optimal answer: 3200320000 == 3200320000 |
| 13 |
Correct |
1 ms |
384 KB |
contestant found the optimal answer: 140072 == 140072 |
| 14 |
Correct |
1 ms |
416 KB |
contestant found the optimal answer: 376041456 == 376041456 |
| 15 |
Correct |
0 ms |
384 KB |
contestant found the optimal answer: 805 == 805 |
| 16 |
Correct |
0 ms |
384 KB |
contestant found the optimal answer: 900189994 == 900189994 |
| 17 |
Correct |
0 ms |
384 KB |
contestant found the optimal answer: 999919994 == 999919994 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
384 KB |
contestant found the optimal answer: 1093956 == 1093956 |
| 2 |
Correct |
0 ms |
384 KB |
contestant found the optimal answer: 302460000 == 302460000 |
| 3 |
Correct |
1 ms |
640 KB |
contestant found the optimal answer: 122453454361 == 122453454361 |
| 4 |
Correct |
0 ms |
384 KB |
contestant found the optimal answer: 93663683509 == 93663683509 |
| 5 |
Correct |
1 ms |
384 KB |
contestant found the optimal answer: 1005304678 == 1005304678 |
| 6 |
Correct |
1 ms |
384 KB |
contestant found the optimal answer: 933702 == 933702 |
| 7 |
Correct |
1 ms |
512 KB |
contestant found the optimal answer: 25082842857 == 25082842857 |
| 8 |
Correct |
0 ms |
384 KB |
contestant found the optimal answer: 687136 == 687136 |
| 9 |
Correct |
1 ms |
384 KB |
contestant found the optimal answer: 27295930079 == 27295930079 |
| 10 |
Correct |
0 ms |
384 KB |
contestant found the optimal answer: 29000419931 == 29000419931 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
512 KB |
contestant found the optimal answer: 610590000 == 610590000 |
| 2 |
Correct |
0 ms |
384 KB |
contestant found the optimal answer: 311760000 == 311760000 |
| 3 |
Correct |
2 ms |
1408 KB |
contestant found the optimal answer: 1989216017013 == 1989216017013 |
| 4 |
Correct |
0 ms |
384 KB |
contestant found the optimal answer: 1499437552673 == 1499437552673 |
| 5 |
Correct |
2 ms |
1152 KB |
contestant found the optimal answer: 1019625819 == 1019625819 |
| 6 |
Correct |
2 ms |
1408 KB |
contestant found the optimal answer: 107630884 == 107630884 |
| 7 |
Correct |
2 ms |
1536 KB |
contestant found the optimal answer: 475357671774 == 475357671774 |
| 8 |
Correct |
1 ms |
640 KB |
contestant found the optimal answer: 193556962 == 193556962 |
| 9 |
Correct |
1 ms |
512 KB |
contestant found the optimal answer: 482389919803 == 482389919803 |
| 10 |
Correct |
2 ms |
640 KB |
contestant found the optimal answer: 490686959791 == 490686959791 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
384 KB |
contestant found the optimal answer: 21503404 == 21503404 |
| 2 |
Correct |
1 ms |
384 KB |
contestant found the optimal answer: 140412195 == 140412195 |
| 3 |
Correct |
5 ms |
2192 KB |
contestant found the optimal answer: 49729674225461 == 49729674225461 |
| 4 |
Correct |
1 ms |
512 KB |
contestant found the optimal answer: 37485571387523 == 37485571387523 |
| 5 |
Correct |
6 ms |
2176 KB |
contestant found the optimal answer: 679388326 == 679388326 |
| 6 |
Correct |
5 ms |
1920 KB |
contestant found the optimal answer: 4699030287 == 4699030287 |
| 7 |
Correct |
6 ms |
2176 KB |
contestant found the optimal answer: 12418819758185 == 12418819758185 |
| 8 |
Correct |
6 ms |
2176 KB |
contestant found the optimal answer: 31093317350 == 31093317350 |
| 9 |
Correct |
2 ms |
768 KB |
contestant found the optimal answer: 12194625429236 == 12194625429236 |
| 10 |
Correct |
3 ms |
1152 KB |
contestant found the optimal answer: 12345131038664 == 12345131038664 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
1152 KB |
contestant found the optimal answer: 1818678304 == 1818678304 |
| 2 |
Correct |
2 ms |
1152 KB |
contestant found the optimal answer: 1326260195 == 1326260195 |
| 3 |
Correct |
42 ms |
9928 KB |
contestant found the optimal answer: 4973126687469639 == 4973126687469639 |
| 4 |
Correct |
3 ms |
1372 KB |
contestant found the optimal answer: 3748491676694116 == 3748491676694116 |
| 5 |
Correct |
32 ms |
6276 KB |
contestant found the optimal answer: 1085432199 == 1085432199 |
| 6 |
Correct |
35 ms |
7148 KB |
contestant found the optimal answer: 514790755404 == 514790755404 |
| 7 |
Correct |
38 ms |
7772 KB |
contestant found the optimal answer: 1256105310476641 == 1256105310476641 |
| 8 |
Correct |
27 ms |
6472 KB |
contestant found the optimal answer: 3099592898816 == 3099592898816 |
| 9 |
Correct |
33 ms |
7256 KB |
contestant found the optimal answer: 1241131419367412 == 1241131419367412 |
| 10 |
Correct |
41 ms |
9048 KB |
contestant found the optimal answer: 1243084101967798 == 1243084101967798 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
21 ms |
8304 KB |
contestant found the optimal answer: 19795776960 == 19795776960 |
| 2 |
Correct |
22 ms |
8448 KB |
contestant found the optimal answer: 19874432173 == 19874432173 |
| 3 |
Correct |
658 ms |
86428 KB |
contestant found the optimal answer: 497313449256899208 == 497313449256899208 |
| 4 |
Correct |
35 ms |
9232 KB |
contestant found the optimal answer: 374850090734572421 == 374850090734572421 |
| 5 |
Correct |
811 ms |
85564 KB |
contestant found the optimal answer: 36183271951 == 36183271951 |
| 6 |
Correct |
340 ms |
60944 KB |
contestant found the optimal answer: 51629847150471 == 51629847150471 |
| 7 |
Correct |
564 ms |
66748 KB |
contestant found the optimal answer: 124074747024496432 == 124074747024496432 |
| 8 |
Correct |
426 ms |
55456 KB |
contestant found the optimal answer: 309959349080800 == 309959349080800 |
| 9 |
Correct |
475 ms |
62596 KB |
contestant found the optimal answer: 124113525649823701 == 124113525649823701 |
| 10 |
Correct |
617 ms |
78188 KB |
contestant found the optimal answer: 124309619349406845 == 124309619349406845 |
