#include <bits/stdc++.h>
#define lsb(x) (x & (-x))
#define ll long long
using namespace std;
const ll INF = 1e18;
const int MAXN = (int) 1e5;
const int MAXK = 200;
ll dp[2][MAXN + 1];
int from[MAXK + 2][MAXN + 1];
ll arr[MAXN + 1];
struct Line {
ll a, b;
int pos;
}deq[MAXN + 1];
inline double inter(Line l1, Line l2) {
if(l1.a == l2.a) {
return INF;
}
return 1.0 * (l2.b - l1.b) / (l1.a - l2.a);
}
inline ll get(Line l, ll x) {
return 1LL * l.a * x + l.b;
}
int main() {
//ifstream cin("C.in");
//ofstream cout("C.out");
int i, j, n, k;
ios::sync_with_stdio(false);
cin >> n >> k;
for(i = 1; i <= n; i++) {
cin >> arr[i];
arr[i] += arr[i - 1];
}
for(j = 2; j <= k + 1; j++) {
memset(dp[j & 1], 0, sizeof(dp[j & 1]));
int b = 0, e = 0;
for(i = 1; i <= n; i++) {
Line l = {arr[i - 1], dp[1 - j & 1][i - 1] - 1LL * arr[i - 1] * arr[i - 1], i - 1};
while(e > b && inter(deq[e - 1], l) - inter(deq[e], deq[e - 1]) < 0) {
e--;
}
deq[++e] = l;
while(b < e && get(deq[b], arr[i]) <= get(deq[b + 1], arr[i])) {
b++;
}
dp[j & 1][i] = get(deq[b], arr[i]);
from[j][i] = deq[b].pos;
}
}
cout << dp[1 - k & 1][n] << "\n";
vector <int> split;
int l = k + 1, c = n;
while(l > 0) {
c = from[l][c];
if(c > 0) {
split.push_back(c);
}
l--;
}
reverse(split.begin(), split.end());
for(auto it : split) {
cout << it << " ";
}
//cin.close();
//cout.close();
return 0;
}
Compilation message
sequence.cpp: In function 'int main()':
sequence.cpp:45:40: warning: suggest parentheses around '-' in operand of '&' [-Wparentheses]
Line l = {arr[i - 1], dp[1 - j & 1][i - 1] - 1LL * arr[i - 1] * arr[i - 1], i - 1};
~~^~~
sequence.cpp:57:18: warning: suggest parentheses around '-' in operand of '&' [-Wparentheses]
cout << dp[1 - k & 1][n] << "\n";
~~^~~
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
3 ms |
1912 KB |
contestant found the optimal answer: 108 == 108 |
| 2 |
Correct |
3 ms |
1912 KB |
contestant found the optimal answer: 999 == 999 |
| 3 |
Correct |
4 ms |
1912 KB |
contestant found the optimal answer: 0 == 0 |
| 4 |
Correct |
3 ms |
2024 KB |
contestant found the optimal answer: 1542524 == 1542524 |
| 5 |
Correct |
3 ms |
2028 KB |
contestant found the optimal answer: 4500000000 == 4500000000 |
| 6 |
Correct |
3 ms |
2028 KB |
contestant found the optimal answer: 1 == 1 |
| 7 |
Correct |
3 ms |
2028 KB |
contestant found the optimal answer: 1 == 1 |
| 8 |
Correct |
3 ms |
2028 KB |
contestant found the optimal answer: 1 == 1 |
| 9 |
Correct |
3 ms |
2232 KB |
contestant found the optimal answer: 100400096 == 100400096 |
| 10 |
Correct |
3 ms |
2232 KB |
contestant found the optimal answer: 900320000 == 900320000 |
| 11 |
Correct |
3 ms |
2232 KB |
contestant found the optimal answer: 3698080248 == 3698080248 |
| 12 |
Correct |
3 ms |
2232 KB |
contestant found the optimal answer: 3200320000 == 3200320000 |
| 13 |
Correct |
3 ms |
2232 KB |
contestant found the optimal answer: 140072 == 140072 |
| 14 |
Correct |
3 ms |
2232 KB |
contestant found the optimal answer: 376041456 == 376041456 |
| 15 |
Correct |
3 ms |
2236 KB |
contestant found the optimal answer: 805 == 805 |
| 16 |
Correct |
4 ms |
2236 KB |
contestant found the optimal answer: 900189994 == 900189994 |
| 17 |
Correct |
4 ms |
2236 KB |
contestant found the optimal answer: 999919994 == 999919994 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
3 ms |
2236 KB |
contestant found the optimal answer: 1093956 == 1093956 |
| 2 |
Correct |
3 ms |
2236 KB |
contestant found the optimal answer: 302460000 == 302460000 |
| 3 |
Correct |
5 ms |
2456 KB |
contestant found the optimal answer: 122453454361 == 122453454361 |
| 4 |
Correct |
4 ms |
2456 KB |
contestant found the optimal answer: 93663683509 == 93663683509 |
| 5 |
Correct |
4 ms |
2456 KB |
contestant found the optimal answer: 1005304678 == 1005304678 |
| 6 |
Correct |
3 ms |
2456 KB |
contestant found the optimal answer: 933702 == 933702 |
| 7 |
Correct |
4 ms |
2456 KB |
contestant found the optimal answer: 25082842857 == 25082842857 |
| 8 |
Correct |
4 ms |
2456 KB |
contestant found the optimal answer: 687136 == 687136 |
| 9 |
Correct |
4 ms |
2456 KB |
contestant found the optimal answer: 27295930079 == 27295930079 |
| 10 |
Correct |
4 ms |
2456 KB |
contestant found the optimal answer: 29000419931 == 29000419931 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
4 ms |
2456 KB |
contestant found the optimal answer: 610590000 == 610590000 |
| 2 |
Correct |
3 ms |
2456 KB |
contestant found the optimal answer: 311760000 == 311760000 |
| 3 |
Correct |
12 ms |
3424 KB |
contestant found the optimal answer: 1989216017013 == 1989216017013 |
| 4 |
Correct |
4 ms |
3424 KB |
contestant found the optimal answer: 1499437552673 == 1499437552673 |
| 5 |
Correct |
9 ms |
3424 KB |
contestant found the optimal answer: 1019625819 == 1019625819 |
| 6 |
Correct |
11 ms |
3424 KB |
contestant found the optimal answer: 107630884 == 107630884 |
| 7 |
Correct |
13 ms |
3432 KB |
contestant found the optimal answer: 475357671774 == 475357671774 |
| 8 |
Correct |
5 ms |
3432 KB |
contestant found the optimal answer: 193556962 == 193556962 |
| 9 |
Correct |
4 ms |
3432 KB |
contestant found the optimal answer: 482389919803 == 482389919803 |
| 10 |
Correct |
6 ms |
3432 KB |
contestant found the optimal answer: 490686959791 == 490686959791 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
4 ms |
3432 KB |
contestant found the optimal answer: 21503404 == 21503404 |
| 2 |
Correct |
3 ms |
3432 KB |
contestant found the optimal answer: 140412195 == 140412195 |
| 3 |
Correct |
15 ms |
4092 KB |
contestant found the optimal answer: 49729674225461 == 49729674225461 |
| 4 |
Correct |
3 ms |
4092 KB |
contestant found the optimal answer: 37485571387523 == 37485571387523 |
| 5 |
Correct |
17 ms |
4108 KB |
contestant found the optimal answer: 679388326 == 679388326 |
| 6 |
Correct |
14 ms |
4108 KB |
contestant found the optimal answer: 4699030287 == 4699030287 |
| 7 |
Correct |
15 ms |
4116 KB |
contestant found the optimal answer: 12418819758185 == 12418819758185 |
| 8 |
Correct |
15 ms |
4140 KB |
contestant found the optimal answer: 31093317350 == 31093317350 |
| 9 |
Correct |
5 ms |
4140 KB |
contestant found the optimal answer: 12194625429236 == 12194625429236 |
| 10 |
Correct |
8 ms |
4140 KB |
contestant found the optimal answer: 12345131038664 == 12345131038664 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
5 ms |
4140 KB |
contestant found the optimal answer: 1818678304 == 1818678304 |
| 2 |
Correct |
6 ms |
4140 KB |
contestant found the optimal answer: 1326260195 == 1326260195 |
| 3 |
Correct |
47 ms |
11508 KB |
contestant found the optimal answer: 4973126687469639 == 4973126687469639 |
| 4 |
Correct |
7 ms |
11508 KB |
contestant found the optimal answer: 3748491676694116 == 3748491676694116 |
| 5 |
Correct |
39 ms |
11508 KB |
contestant found the optimal answer: 1085432199 == 1085432199 |
| 6 |
Correct |
40 ms |
11508 KB |
contestant found the optimal answer: 514790755404 == 514790755404 |
| 7 |
Correct |
46 ms |
11508 KB |
contestant found the optimal answer: 1256105310476641 == 1256105310476641 |
| 8 |
Correct |
33 ms |
11508 KB |
contestant found the optimal answer: 3099592898816 == 3099592898816 |
| 9 |
Correct |
36 ms |
11508 KB |
contestant found the optimal answer: 1241131419367412 == 1241131419367412 |
| 10 |
Correct |
45 ms |
11508 KB |
contestant found the optimal answer: 1243084101967798 == 1243084101967798 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
19 ms |
11508 KB |
contestant found the optimal answer: 19795776960 == 19795776960 |
| 2 |
Correct |
18 ms |
11508 KB |
contestant found the optimal answer: 19874432173 == 19874432173 |
| 3 |
Correct |
319 ms |
84900 KB |
contestant found the optimal answer: 497313449256899208 == 497313449256899208 |
| 4 |
Correct |
33 ms |
84900 KB |
contestant found the optimal answer: 374850090734572421 == 374850090734572421 |
| 5 |
Correct |
493 ms |
85032 KB |
contestant found the optimal answer: 36183271951 == 36183271951 |
| 6 |
Correct |
326 ms |
85032 KB |
contestant found the optimal answer: 51629847150471 == 51629847150471 |
| 7 |
Correct |
359 ms |
85032 KB |
contestant found the optimal answer: 124074747024496432 == 124074747024496432 |
| 8 |
Correct |
259 ms |
85032 KB |
contestant found the optimal answer: 309959349080800 == 309959349080800 |
| 9 |
Correct |
266 ms |
85032 KB |
contestant found the optimal answer: 124113525649823701 == 124113525649823701 |
| 10 |
Correct |
338 ms |
85032 KB |
contestant found the optimal answer: 124309619349406845 == 124309619349406845 |
