#include <bits/stdc++.h>
#define x first
#define y second
#define all(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
typedef pair<ll, ll> p;
struct CHT{
ll a[101010], b[101010], c[101010];
int pv, top;
void init(){
pv = top = 0;
}
ll f(ll idx, ll x){
return a[idx]*x + b[idx];
}
void insert(ll aa, ll bb, ll cc){
if(top >= 1 && aa == a[top-1]){
c[top-1] = cc; return;
}
while(top >= 2 && (b[top-1] - b[top-2]) * (a[top-2] - aa) >= (bb - b[top-2]) * (a[top-2] - a[top-1])) top--;
a[top] = aa;
b[top] = bb;
c[top] = cc;
top++;
if(pv >= top) pv = top - 1;
}
p get(ll x){
while(pv+1 < top && a[pv+1]*x + b[pv+1] > a[pv]*x + b[pv]) pv++;
return {f(pv, x), c[pv]};
}
} cht;
ll arr[101010];
ll sum[101010];
ll dp[2][101010];
int track[222][101010];
vector<int> ans;
int main(){
ios_base::sync_with_stdio(0); cin.tie(0);
int n, k; cin >> n >> k;
for(int i=1; i<=n; i++) cin >> arr[i], sum[i] = sum[i-1] + arr[i];
for(int i=1; i<=k; i++){
cht.init();
cht.insert(0, 0, 0);
for(int j=1; j<=n; j++){
auto now = cht.get(sum[j]);
dp[i&1][j] = now.x;
track[i][j] = now.y;
cht.insert(sum[j], dp[i-1&1][j] - sum[j] * sum[j], j);
}
}
cout << dp[k&1][n] << "\n";
int now = n;
ans.push_back(-1);
for(int i=k; i>=1; i--){
ans.push_back(track[i][now]);
now = track[i][now];
}
sort(all(ans));
for(int i=1; i<=k; i++){
if(!ans[i]) ans[i] = 1;
if(ans[i] <= ans[i-1]) ans[i] = ans[i-1] + 1;
}
for(int i=1; i<=k; i++) cout << ans[i] << " ";
return 0;
}
Compilation message
sequence.cpp: In function 'int main()':
sequence.cpp:58:36: warning: suggest parentheses around '-' in operand of '&' [-Wparentheses]
58 | cht.insert(sum[j], dp[i-1&1][j] - sum[j] * sum[j], j);
| ~^~
| # |
결과 |
실행 시간 |
메모리 |
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 |
1 ms |
340 KB |
contestant found the optimal answer: 4500000000 == 4500000000 |
| 6 |
Correct |
1 ms |
340 KB |
contestant found the optimal answer: 1 == 1 |
| 7 |
Correct |
1 ms |
340 KB |
contestant found the optimal answer: 1 == 1 |
| 8 |
Correct |
1 ms |
340 KB |
contestant found the optimal answer: 1 == 1 |
| 9 |
Correct |
0 ms |
328 KB |
contestant found the optimal answer: 100400096 == 100400096 |
| 10 |
Correct |
0 ms |
328 KB |
contestant found the optimal answer: 900320000 == 900320000 |
| 11 |
Correct |
1 ms |
324 KB |
contestant found the optimal answer: 3698080248 == 3698080248 |
| 12 |
Correct |
1 ms |
340 KB |
contestant found the optimal answer: 3200320000 == 3200320000 |
| 13 |
Correct |
1 ms |
340 KB |
contestant found the optimal answer: 140072 == 140072 |
| 14 |
Correct |
1 ms |
332 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 |
324 KB |
contestant found the optimal answer: 900189994 == 900189994 |
| 17 |
Correct |
1 ms |
340 KB |
contestant found the optimal answer: 999919994 == 999919994 |
| # |
결과 |
실행 시간 |
메모리 |
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 |
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 |
320 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 |
1 ms |
340 KB |
contestant found the optimal answer: 27295930079 == 27295930079 |
| 10 |
Correct |
1 ms |
340 KB |
contestant found the optimal answer: 29000419931 == 29000419931 |
| # |
결과 |
실행 시간 |
메모리 |
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 |
1 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 |
1092 KB |
contestant found the optimal answer: 1019625819 == 1019625819 |
| 6 |
Correct |
2 ms |
1364 KB |
contestant found the optimal answer: 107630884 == 107630884 |
| 7 |
Correct |
1 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 |
452 KB |
contestant found the optimal answer: 482389919803 == 482389919803 |
| 10 |
Correct |
1 ms |
596 KB |
contestant found the optimal answer: 490686959791 == 490686959791 |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
0 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 |
3 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 |
4 ms |
2132 KB |
contestant found the optimal answer: 679388326 == 679388326 |
| 6 |
Correct |
4 ms |
1860 KB |
contestant found the optimal answer: 4699030287 == 4699030287 |
| 7 |
Correct |
5 ms |
2132 KB |
contestant found the optimal answer: 12418819758185 == 12418819758185 |
| 8 |
Correct |
3 ms |
2132 KB |
contestant found the optimal answer: 31093317350 == 31093317350 |
| 9 |
Correct |
1 ms |
724 KB |
contestant found the optimal answer: 12194625429236 == 12194625429236 |
| 10 |
Correct |
2 ms |
1108 KB |
contestant found the optimal answer: 12345131038664 == 12345131038664 |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
2 ms |
980 KB |
contestant found the optimal answer: 1818678304 == 1818678304 |
| 2 |
Correct |
1 ms |
980 KB |
contestant found the optimal answer: 1326260195 == 1326260195 |
| 3 |
Correct |
23 ms |
9628 KB |
contestant found the optimal answer: 4973126687469639 == 4973126687469639 |
| 4 |
Correct |
2 ms |
980 KB |
contestant found the optimal answer: 3748491676694116 == 3748491676694116 |
| 5 |
Correct |
24 ms |
6092 KB |
contestant found the optimal answer: 1085432199 == 1085432199 |
| 6 |
Correct |
24 ms |
6948 KB |
contestant found the optimal answer: 514790755404 == 514790755404 |
| 7 |
Correct |
32 ms |
7484 KB |
contestant found the optimal answer: 1256105310476641 == 1256105310476641 |
| 8 |
Correct |
21 ms |
6256 KB |
contestant found the optimal answer: 3099592898816 == 3099592898816 |
| 9 |
Correct |
21 ms |
6988 KB |
contestant found the optimal answer: 1241131419367412 == 1241131419367412 |
| 10 |
Correct |
25 ms |
8784 KB |
contestant found the optimal answer: 1243084101967798 == 1243084101967798 |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
13 ms |
6484 KB |
contestant found the optimal answer: 19795776960 == 19795776960 |
| 2 |
Correct |
13 ms |
6720 KB |
contestant found the optimal answer: 19874432173 == 19874432173 |
| 3 |
Correct |
200 ms |
85320 KB |
contestant found the optimal answer: 497313449256899208 == 497313449256899208 |
| 4 |
Correct |
12 ms |
7508 KB |
contestant found the optimal answer: 374850090734572421 == 374850090734572421 |
| 5 |
Correct |
399 ms |
84764 KB |
contestant found the optimal answer: 36183271951 == 36183271951 |
| 6 |
Correct |
220 ms |
60840 KB |
contestant found the optimal answer: 51629847150471 == 51629847150471 |
| 7 |
Correct |
283 ms |
65564 KB |
contestant found the optimal answer: 124074747024496432 == 124074747024496432 |
| 8 |
Correct |
179 ms |
54348 KB |
contestant found the optimal answer: 309959349080800 == 309959349080800 |
| 9 |
Correct |
183 ms |
61280 KB |
contestant found the optimal answer: 124113525649823701 == 124113525649823701 |
| 10 |
Correct |
229 ms |
77012 KB |
contestant found the optimal answer: 124309619349406845 == 124309619349406845 |
