#include <bits/stdc++.h>
using namespace std;
long long dv(long long a, long long b) { return a / b /*- ((a^b)<0 && a%b)*/; }
struct Line {
long long a, b; int id;
Line(long long _a, long long _b, int _id) : a(_a), b(_b), id(_id) {}
long long intersect(Line L) { return dv(L.b-b, a-L.a); }
// double intersect(const Line& L) const { return (double)(L.b-b) / (a-L.a); }
long long eval(long long x) { return a*x + b; }
};
struct CHT {
deque<Line> cht;
void add(Line L) {
if(cht.size() && cht.front().a == L.a) {
if(cht.front().b > L.b) return;
cht.pop_front();
}
while(cht.size() >= 2 && L.intersect(cht[1]) < L.intersect(cht[0]))
cht.pop_front();
cht.push_front(L);
}
Line query(int x) {
/* Line ans(-1, -1, -1);
for(Line l : cht)
if(l.eval(x) > ans.eval(x)) ans = l;
return ans; */
while(cht.size() >= 2 && cht[ cht.size() - 2 ].eval(x) >= cht.back().eval(x))
cht.pop_back();
return cht.back();
}
} cht;
constexpr int maxn = 2e5+10, maxk = 210;
int a[maxn];
long long suf[maxn];
long long dp[2][maxn];
int opt[maxk][maxn];
int32_t main() {
int n, k; scanf("%d %d", &n, &k);
for(int i = 1; i <= n; i++)
scanf("%d", a+i);
// dp[i] = dp[j] + suf[i+1] * (suf[j+1] - suf[i+1])
// dp[i] = dp[j] + {suf[j+1] * suf[i+1]} - (suf[i+1]^2)
for(int i = n; i >= 1; i--)
suf[i] = a[i] + suf[i+1];
for(int i = 1; i <= k; i++) {
cht.cht.clear();
cht.add(Line(suf[1], 0, -1));
for(int j = 1; j <= n; j++) {
Line bom = cht.query(suf[j+1]);
opt[i][j] = bom.id;
dp[1][j] = bom.eval(suf[j+1]) - 1ll*suf[j+1]*suf[j+1];
cht.add(Line(suf[j+1], dp[0][j], j));
}
for(int j = 1; j <= n; j++)
dp[0][j] = dp[1][j], dp[1][j] = 0;
}
long long ans = 0;
for(int j = 1; j < n; j++)
if(dp[0][j] >= dp[0][ans]) ans = j;
printf("%lld\n", dp[0][ans]);
for(int i = 0; i < k; i++)
assert(ans >= 0), printf("%lld ", ans), ans = opt[k-i][ans];
puts("");
}
Compilation message
sequence.cpp: In function 'int32_t main()':
sequence.cpp:47:17: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
47 | int n, k; scanf("%d %d", &n, &k);
| ~~~~~^~~~~~~~~~~~~~~~~
sequence.cpp:49:8: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
49 | scanf("%d", a+i);
| ~~~~~^~~~~~~~~~~
| # |
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 |
1 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 |
1 ms |
212 KB |
contestant found the optimal answer: 1 == 1 |
| 7 |
Correct |
0 ms |
212 KB |
contestant found the optimal answer: 1 == 1 |
| 8 |
Correct |
0 ms |
212 KB |
contestant found the optimal answer: 1 == 1 |
| 9 |
Correct |
0 ms |
340 KB |
contestant found the optimal answer: 100400096 == 100400096 |
| 10 |
Correct |
1 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 |
0 ms |
340 KB |
contestant found the optimal answer: 302460000 == 302460000 |
| 3 |
Correct |
0 ms |
596 KB |
contestant found the optimal answer: 122453454361 == 122453454361 |
| 4 |
Correct |
0 ms |
340 KB |
contestant found the optimal answer: 93663683509 == 93663683509 |
| 5 |
Correct |
0 ms |
340 KB |
contestant found the optimal answer: 1005304678 == 1005304678 |
| 6 |
Correct |
0 ms |
340 KB |
contestant found the optimal answer: 933702 == 933702 |
| 7 |
Correct |
0 ms |
468 KB |
contestant found the optimal answer: 25082842857 == 25082842857 |
| 8 |
Correct |
0 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 |
1 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 |
1492 KB |
contestant found the optimal answer: 1989216017013 == 1989216017013 |
| 4 |
Correct |
0 ms |
340 KB |
contestant found the optimal answer: 1499437552673 == 1499437552673 |
| 5 |
Correct |
2 ms |
1236 KB |
contestant found the optimal answer: 1019625819 == 1019625819 |
| 6 |
Correct |
2 ms |
1364 KB |
contestant found the optimal answer: 107630884 == 107630884 |
| 7 |
Correct |
2 ms |
1492 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 |
8 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 |
9 ms |
2260 KB |
contestant found the optimal answer: 679388326 == 679388326 |
| 6 |
Correct |
7 ms |
1876 KB |
contestant found the optimal answer: 4699030287 == 4699030287 |
| 7 |
Correct |
10 ms |
2156 KB |
contestant found the optimal answer: 12418819758185 == 12418819758185 |
| 8 |
Correct |
7 ms |
2260 KB |
contestant found the optimal answer: 31093317350 == 31093317350 |
| 9 |
Correct |
2 ms |
724 KB |
contestant found the optimal answer: 12194625429236 == 12194625429236 |
| 10 |
Correct |
4 ms |
1108 KB |
contestant found the optimal answer: 12345131038664 == 12345131038664 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
852 KB |
contestant found the optimal answer: 1818678304 == 1818678304 |
| 2 |
Correct |
2 ms |
852 KB |
contestant found the optimal answer: 1326260195 == 1326260195 |
| 3 |
Correct |
76 ms |
9724 KB |
contestant found the optimal answer: 4973126687469639 == 4973126687469639 |
| 4 |
Correct |
3 ms |
980 KB |
contestant found the optimal answer: 3748491676694116 == 3748491676694116 |
| 5 |
Correct |
53 ms |
6004 KB |
contestant found the optimal answer: 1085432199 == 1085432199 |
| 6 |
Correct |
54 ms |
7024 KB |
contestant found the optimal answer: 514790755404 == 514790755404 |
| 7 |
Correct |
62 ms |
7424 KB |
contestant found the optimal answer: 1256105310476641 == 1256105310476641 |
| 8 |
Correct |
48 ms |
6164 KB |
contestant found the optimal answer: 3099592898816 == 3099592898816 |
| 9 |
Correct |
52 ms |
7048 KB |
contestant found the optimal answer: 1241131419367412 == 1241131419367412 |
| 10 |
Correct |
80 ms |
8752 KB |
contestant found the optimal answer: 1243084101967798 == 1243084101967798 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
20 ms |
6188 KB |
contestant found the optimal answer: 19795776960 == 19795776960 |
| 2 |
Correct |
21 ms |
6100 KB |
contestant found the optimal answer: 19874432173 == 19874432173 |
| 3 |
Correct |
715 ms |
84268 KB |
contestant found the optimal answer: 497313449256899208 == 497313449256899208 |
| 4 |
Correct |
20 ms |
6660 KB |
contestant found the optimal answer: 374850090734572421 == 374850090734572421 |
| 5 |
Correct |
836 ms |
84212 KB |
contestant found the optimal answer: 36183271951 == 36183271951 |
| 6 |
Correct |
592 ms |
60428 KB |
contestant found the optimal answer: 51629847150471 == 51629847150471 |
| 7 |
Correct |
630 ms |
64296 KB |
contestant found the optimal answer: 124074747024496432 == 124074747024496432 |
| 8 |
Correct |
480 ms |
53328 KB |
contestant found the optimal answer: 309959349080800 == 309959349080800 |
| 9 |
Correct |
542 ms |
60440 KB |
contestant found the optimal answer: 124113525649823701 == 124113525649823701 |
| 10 |
Correct |
706 ms |
76200 KB |
contestant found the optimal answer: 124309619349406845 == 124309619349406845 |
