#include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
long long t, n, m, k, a[100005], dp[100005], sum[100005], mod = 1e9 + 7, inf = 1e18;
int trace[100005][205];
string s;
mt19937_64 rng;
struct lines{
long long a, b, index;
lines(long long a = 0, long long b = 0, long long index = 0) : a(a), b(b), index(index){}
long long f(long long x){
return 1LL * a * x + b;
};
};
long double slope(lines ln1, lines ln2) {
return (long double) (ln2.b - ln1.b) / (long double) (ln2.a - ln1.a);
}
struct cht{
vector<lines> lns;
long long ptr = 0;
void add(long long a, long long b, long long index){
lines ln(a, b, index);
while(lns.size() > 1 && (slope(lns[lns.size() - 2], lns.back()) - slope(lns[lns.size() - 2], ln)) <= 1e-18) lns.pop_back();
lns.push_back(ln); ptr = min(ptr, (long long) lns.size() - 1);
}
pair<long long, long long> get(long long x){
if(lns.empty()) return {-inf, 0};
while (ptr + 1 < lns.size() && lns[ptr].f(x) <= lns[ptr + 1].f(x)) ptr++;
return {lns[ptr].f(x), lns[ptr].index};
}
};
cht osu[5];
void solve(){
osu[0].add(0, 0, 0);
for(long long j = 1; j <= k; j++){
for(long long i = 1; i <= n; i++){
long long num = sum[i] * sum[n] - sum[i] * sum[i];
pair<long long, long long> x = osu[0].get(sum[i] - sum[n]);
dp[i] = x.fi + num;
trace[i][j] = x.se;
osu[1].add(sum[i], dp[i], i);
// cout << dp[i] <<" "<< i <<" "<< j <<" "<< trace[i][j] << "\n";
}
osu[0] = osu[1];
osu[1].lns.clear(); osu[1].ptr = 0;
}
long long answer = 0;
for(long long i = 1; i <= n; i++) answer = max(answer, dp[i]);
cout << answer << "\n";
for(long long i = 1; i <= n; i++){
if(answer != dp[i]) continue;
vector<long long> v;
int x = i;
for(long long i = k; i >= 1; i--){
// cout << x <<" ";
v.push_back(x);
x = max(1, min(trace[x][i], x - 1));
}
reverse(v.begin(), v.end());
for(auto i: v) cout << i <<" ";
return;
}
}
signed main(){
ios_base::sync_with_stdio(NULL); cin.tie(nullptr); cout.tie(nullptr);
rng.seed((long long)main ^ time(0));
#ifdef Kawaii
auto starttime = chrono::high_resolution_clock::now();
#endif
cin >> n >> k;
// n = 1e5, k = 200;
for(long long i = 1; i <= n; i++){
cin >> a[i];
// a[i] = rng() % 10001;
sum[i] = sum[i - 1] + a[i];
}
solve();
#ifdef Kawaii
auto endtime = chrono::high_resolution_clock::now();
auto duration = chrono::duration_cast<chrono::milliseconds>(endtime - starttime).count();
cout << "\n=====" << "\nUsed: " << duration << " ms\n";
#endif
}
Compilation message
sequence.cpp: In member function 'std::pair<long long int, long long int> cht::get(long long int)':
sequence.cpp:33:24: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<lines>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
33 | while (ptr + 1 < lns.size() && lns[ptr].f(x) <= lns[ptr + 1].f(x)) ptr++;
| ~~~~~~~~^~~~~~~~~~~~
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
340 KB |
contestant found the optimal answer: 108 == 108 |
| 2 |
Correct |
1 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 |
1 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 |
352 KB |
contestant found the optimal answer: 1 == 1 |
| 7 |
Correct |
0 ms |
332 KB |
contestant found the optimal answer: 1 == 1 |
| 8 |
Correct |
1 ms |
356 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 |
328 KB |
contestant found the optimal answer: 900320000 == 900320000 |
| 11 |
Correct |
1 ms |
328 KB |
contestant found the optimal answer: 3698080248 == 3698080248 |
| 12 |
Correct |
1 ms |
332 KB |
contestant found the optimal answer: 3200320000 == 3200320000 |
| 13 |
Correct |
1 ms |
328 KB |
contestant found the optimal answer: 140072 == 140072 |
| 14 |
Correct |
1 ms |
340 KB |
contestant found the optimal answer: 376041456 == 376041456 |
| 15 |
Correct |
1 ms |
340 KB |
contestant found the optimal answer: 805 == 805 |
| 16 |
Correct |
1 ms |
340 KB |
contestant found the optimal answer: 900189994 == 900189994 |
| 17 |
Correct |
1 ms |
340 KB |
contestant found the optimal answer: 999919994 == 999919994 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 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 |
340 KB |
contestant found the optimal answer: 122453454361 == 122453454361 |
| 4 |
Correct |
0 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 |
340 KB |
contestant found the optimal answer: 25082842857 == 25082842857 |
| 8 |
Correct |
1 ms |
340 KB |
contestant found the optimal answer: 687136 == 687136 |
| 9 |
Correct |
1 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 |
468 KB |
contestant found the optimal answer: 610590000 == 610590000 |
| 2 |
Correct |
1 ms |
468 KB |
contestant found the optimal answer: 311760000 == 311760000 |
| 3 |
Correct |
2 ms |
468 KB |
contestant found the optimal answer: 1989216017013 == 1989216017013 |
| 4 |
Correct |
1 ms |
456 KB |
contestant found the optimal answer: 1499437552673 == 1499437552673 |
| 5 |
Correct |
1 ms |
468 KB |
contestant found the optimal answer: 1019625819 == 1019625819 |
| 6 |
Correct |
2 ms |
468 KB |
contestant found the optimal answer: 107630884 == 107630884 |
| 7 |
Correct |
2 ms |
468 KB |
contestant found the optimal answer: 475357671774 == 475357671774 |
| 8 |
Correct |
1 ms |
464 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 |
468 KB |
contestant found the optimal answer: 490686959791 == 490686959791 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
1228 KB |
contestant found the optimal answer: 21503404 == 21503404 |
| 2 |
Correct |
1 ms |
1108 KB |
contestant found the optimal answer: 140412195 == 140412195 |
| 3 |
Correct |
4 ms |
1236 KB |
contestant found the optimal answer: 49729674225461 == 49729674225461 |
| 4 |
Correct |
1 ms |
1232 KB |
contestant found the optimal answer: 37485571387523 == 37485571387523 |
| 5 |
Correct |
6 ms |
1108 KB |
contestant found the optimal answer: 679388326 == 679388326 |
| 6 |
Correct |
5 ms |
1228 KB |
contestant found the optimal answer: 4699030287 == 4699030287 |
| 7 |
Correct |
5 ms |
1236 KB |
contestant found the optimal answer: 12418819758185 == 12418819758185 |
| 8 |
Correct |
4 ms |
1236 KB |
contestant found the optimal answer: 31093317350 == 31093317350 |
| 9 |
Correct |
2 ms |
1232 KB |
contestant found the optimal answer: 12194625429236 == 12194625429236 |
| 10 |
Correct |
3 ms |
1108 KB |
contestant found the optimal answer: 12345131038664 == 12345131038664 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
6 ms |
9108 KB |
contestant found the optimal answer: 1818678304 == 1818678304 |
| 2 |
Correct |
5 ms |
9116 KB |
contestant found the optimal answer: 1326260195 == 1326260195 |
| 3 |
Correct |
38 ms |
9252 KB |
contestant found the optimal answer: 4973126687469639 == 4973126687469639 |
| 4 |
Correct |
7 ms |
9168 KB |
contestant found the optimal answer: 3748491676694116 == 3748491676694116 |
| 5 |
Correct |
32 ms |
9136 KB |
contestant found the optimal answer: 1085432199 == 1085432199 |
| 6 |
Correct |
35 ms |
9108 KB |
contestant found the optimal answer: 514790755404 == 514790755404 |
| 7 |
Correct |
40 ms |
9296 KB |
contestant found the optimal answer: 1256105310476641 == 1256105310476641 |
| 8 |
Correct |
28 ms |
9256 KB |
contestant found the optimal answer: 3099592898816 == 3099592898816 |
| 9 |
Correct |
37 ms |
9196 KB |
contestant found the optimal answer: 1241131419367412 == 1241131419367412 |
| 10 |
Correct |
47 ms |
9296 KB |
contestant found the optimal answer: 1243084101967798 == 1243084101967798 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
44 ms |
86972 KB |
contestant found the optimal answer: 19795776960 == 19795776960 |
| 2 |
Correct |
42 ms |
86976 KB |
contestant found the optimal answer: 19874432173 == 19874432173 |
| 3 |
Correct |
565 ms |
88140 KB |
contestant found the optimal answer: 497313449256899208 == 497313449256899208 |
| 4 |
Correct |
44 ms |
88172 KB |
contestant found the optimal answer: 374850090734572421 == 374850090734572421 |
| 5 |
Correct |
609 ms |
86972 KB |
contestant found the optimal answer: 36183271951 == 36183271951 |
| 6 |
Correct |
419 ms |
86928 KB |
contestant found the optimal answer: 51629847150471 == 51629847150471 |
| 7 |
Correct |
463 ms |
88184 KB |
contestant found the optimal answer: 124074747024496432 == 124074747024496432 |
| 8 |
Correct |
357 ms |
88092 KB |
contestant found the optimal answer: 309959349080800 == 309959349080800 |
| 9 |
Correct |
422 ms |
87532 KB |
contestant found the optimal answer: 124113525649823701 == 124113525649823701 |
| 10 |
Correct |
514 ms |
87636 KB |
contestant found the optimal answer: 124309619349406845 == 124309619349406845 |
