#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N=1e5+5;
const int K=205;
const ll inf=1e18;
int n,k;
int a[N];
ll qs[N],dp[2][N];
int opt[K][N];
struct convexhull{
struct line{
ll m,c;
int id;
line(){}
line(ll m,ll c,int id):m(m),c(c),id(id){}
ll get(ll x){
return m*x+c;
}
};
bool bad(line l1,line l2,line l3){
return (l3.c-l1.c)*(l1.m-l2.m)<=(l2.c-l1.c)*(l1.m-l3.m);
}
deque<line> hull;
void init(){
hull.clear();
}
void insert(ll m,ll c,int id){
line l(m,c,id);
while(hull.size()>1&&bad(hull.end()[-2],hull.back(),l))hull.pop_back();
hull.emplace_back(l);
}
pair<ll,int> query(ll x){
while(hull.size()>1&&hull[1].get(x)>=hull[0].get(x))hull.pop_front();
return {hull[0].get(x),hull[0].id};
}
}hull;
int main(){
cin.tie(nullptr)->sync_with_stdio(false);
cin >> n >> k;
for(int i=1;i<=n;i++)cin >> a[i];
for(int i=1;i<=n;i++)qs[i]=qs[i-1]+a[i];
for(int i=1;i<=k;i++){
hull.init();
hull.insert(0,0,0);
for(int j=1;j<=n;j++){
auto [val,id]=hull.query(qs[j]);
dp[i&1][j]=qs[j]*(qs[n]-qs[j])+val;
opt[i][j]=id;
hull.insert(qs[j],-qs[j]*qs[n]+dp[i&1^1][j],j);
}
}
ll ans=-inf;
int id=0;
for(int i=k;i<=n;i++){
if(dp[k&1][i]>ans){
ans=dp[k&1][i];
id=i;
}
}
vector<int> res;
for(int i=k;i>=1;i--){
res.emplace_back(id);
id=opt[i][id];
}
reverse(res.begin(),res.end());
cout << ans << "\n";
for(auto x:res)cout << x << " ";
}
Compilation message
sequence.cpp: In function 'int main()':
sequence.cpp:53:18: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
53 | auto [val,id]=hull.query(qs[j]);
| ^
sequence.cpp:56:48: warning: suggest parentheses around arithmetic in operand of '^' [-Wparentheses]
56 | hull.insert(qs[j],-qs[j]*qs[n]+dp[i&1^1][j],j);
| ~^~
| # |
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 |
0 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 |
1 ms |
340 KB |
contestant found the optimal answer: 4500000000 == 4500000000 |
| 6 |
Correct |
0 ms |
340 KB |
contestant found the optimal answer: 1 == 1 |
| 7 |
Correct |
0 ms |
340 KB |
contestant found the optimal answer: 1 == 1 |
| 8 |
Correct |
0 ms |
340 KB |
contestant found the optimal answer: 1 == 1 |
| 9 |
Correct |
0 ms |
340 KB |
contestant found the optimal answer: 100400096 == 100400096 |
| 10 |
Correct |
0 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 |
1 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 |
1 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 |
0 ms |
340 KB |
contestant found the optimal answer: 29000419931 == 29000419931 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 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 |
0 ms |
340 KB |
contestant found the optimal answer: 1499437552673 == 1499437552673 |
| 5 |
Correct |
1 ms |
1108 KB |
contestant found the optimal answer: 1019625819 == 1019625819 |
| 6 |
Correct |
1 ms |
1236 KB |
contestant found the optimal answer: 107630884 == 107630884 |
| 7 |
Correct |
2 ms |
1364 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 |
0 ms |
340 KB |
contestant found the optimal answer: 140412195 == 140412195 |
| 3 |
Correct |
4 ms |
2004 KB |
contestant found the optimal answer: 49729674225461 == 49729674225461 |
| 4 |
Correct |
0 ms |
340 KB |
contestant found the optimal answer: 37485571387523 == 37485571387523 |
| 5 |
Correct |
5 ms |
2132 KB |
contestant found the optimal answer: 679388326 == 679388326 |
| 6 |
Correct |
5 ms |
1796 KB |
contestant found the optimal answer: 4699030287 == 4699030287 |
| 7 |
Correct |
5 ms |
2004 KB |
contestant found the optimal answer: 12418819758185 == 12418819758185 |
| 8 |
Correct |
4 ms |
2004 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 |
980 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 |
1 ms |
852 KB |
contestant found the optimal answer: 1326260195 == 1326260195 |
| 3 |
Correct |
39 ms |
9464 KB |
contestant found the optimal answer: 4973126687469639 == 4973126687469639 |
| 4 |
Correct |
2 ms |
852 KB |
contestant found the optimal answer: 3748491676694116 == 3748491676694116 |
| 5 |
Correct |
35 ms |
6036 KB |
contestant found the optimal answer: 1085432199 == 1085432199 |
| 6 |
Correct |
33 ms |
6732 KB |
contestant found the optimal answer: 514790755404 == 514790755404 |
| 7 |
Correct |
38 ms |
7212 KB |
contestant found the optimal answer: 1256105310476641 == 1256105310476641 |
| 8 |
Correct |
28 ms |
6008 KB |
contestant found the optimal answer: 3099592898816 == 3099592898816 |
| 9 |
Correct |
32 ms |
6824 KB |
contestant found the optimal answer: 1241131419367412 == 1241131419367412 |
| 10 |
Correct |
41 ms |
8528 KB |
contestant found the optimal answer: 1243084101967798 == 1243084101967798 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
12 ms |
5136 KB |
contestant found the optimal answer: 19795776960 == 19795776960 |
| 2 |
Correct |
12 ms |
5112 KB |
contestant found the optimal answer: 19874432173 == 19874432173 |
| 3 |
Correct |
376 ms |
82712 KB |
contestant found the optimal answer: 497313449256899208 == 497313449256899208 |
| 4 |
Correct |
12 ms |
5652 KB |
contestant found the optimal answer: 374850090734572421 == 374850090734572421 |
| 5 |
Correct |
523 ms |
82376 KB |
contestant found the optimal answer: 36183271951 == 36183271951 |
| 6 |
Correct |
341 ms |
58932 KB |
contestant found the optimal answer: 51629847150471 == 51629847150471 |
| 7 |
Correct |
375 ms |
63124 KB |
contestant found the optimal answer: 124074747024496432 == 124074747024496432 |
| 8 |
Correct |
278 ms |
52112 KB |
contestant found the optimal answer: 309959349080800 == 309959349080800 |
| 9 |
Correct |
306 ms |
59044 KB |
contestant found the optimal answer: 124113525649823701 == 124113525649823701 |
| 10 |
Correct |
446 ms |
74804 KB |
contestant found the optimal answer: 124309619349406845 == 124309619349406845 |
