#include<bits/stdc++.h>
using namespace std;
int ar[100005];
struct line{
long long m,c;
int num;
line(long long mm=0,long long cc=0,long long i=0){
m=mm;
c=cc;
num=i;
}
long long pnt(long long x){
return m*x+c;
}
};
bool better(line a,line b,line c){
return (c.c-a.c)*(a.m-b.m)<=(b.c-a.c)*(a.m-c.m);
}
struct hull{
deque<line>dq;
void add(line x){
while(dq.size()>1&&better(dq[dq.size()-2],dq.back(),x)){
dq.pop_back();
}
dq.push_back(x);
}
pair<long long,int> fbest(long long x,int mxl){
while(dq.size()>1&&dq.front().num<mxl&&(dq.front().pnt(x)<=dq[1].pnt(x))){
dq.pop_front();
}
if(dq.empty()){
return {0,0};
}
return {dq.front().pnt(x),dq.front().num};
}
}hl;
long long sum[100005];
int path[205][100005];
line info[2][100005];
vector<int>v;
int main(){
int n,k;
cin>>n>>k;
long long sm=0;
for(int i=1;i<=n;i++){
cin>>ar[i];
sm+=ar[i];
sum[i]=sm;
}
long long ans=0;
long long lnum=0;
//cerr<<"work"<<endl;
for(int i=1;i<=k;i++){
hl.dq.clear();
for(int j=i;j<n;j++){
//cerr<<"i:j "<<i<<" "<<j<<endl;
if(i!=1){
hl.add(info[i%2][j-1]);
}
pair<long long,int>p=hl.fbest(sum[j],j);
//cerr<<"after fbest"<<endl;
long long x=p.first;
//cerr<<"x:"<<x<<endl;
int pn=p.second;
long long tans=x+sm*sum[j]-sum[j]*sum[j];
//cerr<<"ans:"<<tans<<endl;
long long nm=sum[j];
long long nc=tans-sm*sum[j];
info[(i+1)%2][j]=(line(nm,nc,j));
//cerr<<"after add"<<endl;
path[i][j]=pn;
if(i==k){
if(tans>ans){
ans=tans;
lnum=j;
}
}
}
}
//cerr<<"out"<<endl;
cout<<ans<<"\n";
v.push_back(lnum);
for(int i=k;i>=2;i--){
lnum=path[i][lnum];
v.push_back(lnum);
}
for(int i=v.size()-1;i>=0;i--){
cout<<v[i]<<" ";
}
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
4948 KB |
contestant found the optimal answer: 108 == 108 |
| 2 |
Correct |
2 ms |
4948 KB |
contestant found the optimal answer: 999 == 999 |
| 3 |
Incorrect |
2 ms |
4948 KB |
Integer 0 violates the range [1, 1] |
| 4 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
4948 KB |
contestant found the optimal answer: 1093956 == 1093956 |
| 2 |
Correct |
2 ms |
4948 KB |
contestant found the optimal answer: 302460000 == 302460000 |
| 3 |
Correct |
2 ms |
5204 KB |
contestant found the optimal answer: 122453454361 == 122453454361 |
| 4 |
Correct |
2 ms |
4948 KB |
contestant found the optimal answer: 93663683509 == 93663683509 |
| 5 |
Correct |
2 ms |
4948 KB |
contestant found the optimal answer: 1005304678 == 1005304678 |
| 6 |
Correct |
2 ms |
4948 KB |
contestant found the optimal answer: 933702 == 933702 |
| 7 |
Correct |
2 ms |
5076 KB |
contestant found the optimal answer: 25082842857 == 25082842857 |
| 8 |
Correct |
2 ms |
4948 KB |
contestant found the optimal answer: 687136 == 687136 |
| 9 |
Correct |
2 ms |
4948 KB |
contestant found the optimal answer: 27295930079 == 27295930079 |
| 10 |
Correct |
2 ms |
5076 KB |
contestant found the optimal answer: 29000419931 == 29000419931 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
4948 KB |
contestant found the optimal answer: 610590000 == 610590000 |
| 2 |
Correct |
3 ms |
4948 KB |
contestant found the optimal answer: 311760000 == 311760000 |
| 3 |
Correct |
3 ms |
5972 KB |
contestant found the optimal answer: 1989216017013 == 1989216017013 |
| 4 |
Correct |
2 ms |
4948 KB |
contestant found the optimal answer: 1499437552673 == 1499437552673 |
| 5 |
Correct |
3 ms |
5716 KB |
contestant found the optimal answer: 1019625819 == 1019625819 |
| 6 |
Correct |
3 ms |
5844 KB |
contestant found the optimal answer: 107630884 == 107630884 |
| 7 |
Correct |
3 ms |
5972 KB |
contestant found the optimal answer: 475357671774 == 475357671774 |
| 8 |
Correct |
3 ms |
5204 KB |
contestant found the optimal answer: 193556962 == 193556962 |
| 9 |
Correct |
3 ms |
5076 KB |
contestant found the optimal answer: 482389919803 == 482389919803 |
| 10 |
Correct |
2 ms |
5204 KB |
contestant found the optimal answer: 490686959791 == 490686959791 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
4948 KB |
contestant found the optimal answer: 21503404 == 21503404 |
| 2 |
Correct |
2 ms |
4948 KB |
contestant found the optimal answer: 140412195 == 140412195 |
| 3 |
Correct |
7 ms |
6612 KB |
contestant found the optimal answer: 49729674225461 == 49729674225461 |
| 4 |
Correct |
2 ms |
4948 KB |
contestant found the optimal answer: 37485571387523 == 37485571387523 |
| 5 |
Correct |
7 ms |
6612 KB |
contestant found the optimal answer: 679388326 == 679388326 |
| 6 |
Correct |
7 ms |
6356 KB |
contestant found the optimal answer: 4699030287 == 4699030287 |
| 7 |
Correct |
8 ms |
6616 KB |
contestant found the optimal answer: 12418819758185 == 12418819758185 |
| 8 |
Correct |
6 ms |
6612 KB |
contestant found the optimal answer: 31093317350 == 31093317350 |
| 9 |
Correct |
3 ms |
5332 KB |
contestant found the optimal answer: 12194625429236 == 12194625429236 |
| 10 |
Correct |
5 ms |
5716 KB |
contestant found the optimal answer: 12345131038664 == 12345131038664 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
4 ms |
5332 KB |
contestant found the optimal answer: 1818678304 == 1818678304 |
| 2 |
Correct |
4 ms |
5460 KB |
contestant found the optimal answer: 1326260195 == 1326260195 |
| 3 |
Correct |
49 ms |
13912 KB |
contestant found the optimal answer: 4973126687469639 == 4973126687469639 |
| 4 |
Correct |
4 ms |
5332 KB |
contestant found the optimal answer: 3748491676694116 == 3748491676694116 |
| 5 |
Correct |
39 ms |
10452 KB |
contestant found the optimal answer: 1085432199 == 1085432199 |
| 6 |
Correct |
42 ms |
11208 KB |
contestant found the optimal answer: 514790755404 == 514790755404 |
| 7 |
Correct |
45 ms |
11644 KB |
contestant found the optimal answer: 1256105310476641 == 1256105310476641 |
| 8 |
Correct |
34 ms |
10444 KB |
contestant found the optimal answer: 3099592898816 == 3099592898816 |
| 9 |
Correct |
40 ms |
11216 KB |
contestant found the optimal answer: 1241131419367412 == 1241131419367412 |
| 10 |
Correct |
50 ms |
13008 KB |
contestant found the optimal answer: 1243084101967798 == 1243084101967798 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
20 ms |
8376 KB |
contestant found the optimal answer: 19795776960 == 19795776960 |
| 2 |
Correct |
20 ms |
8216 KB |
contestant found the optimal answer: 19874432173 == 19874432173 |
| 3 |
Correct |
462 ms |
85316 KB |
contestant found the optimal answer: 497313449256899208 == 497313449256899208 |
| 4 |
Correct |
32 ms |
8268 KB |
contestant found the optimal answer: 374850090734572421 == 374850090734572421 |
| 5 |
Correct |
620 ms |
85268 KB |
contestant found the optimal answer: 36183271951 == 36183271951 |
| 6 |
Correct |
422 ms |
61808 KB |
contestant found the optimal answer: 51629847150471 == 51629847150471 |
| 7 |
Correct |
442 ms |
65752 KB |
contestant found the optimal answer: 124074747024496432 == 124074747024496432 |
| 8 |
Correct |
361 ms |
54856 KB |
contestant found the optimal answer: 309959349080800 == 309959349080800 |
| 9 |
Correct |
387 ms |
61844 KB |
contestant found the optimal answer: 124113525649823701 == 124113525649823701 |
| 10 |
Correct |
486 ms |
77468 KB |
contestant found the optimal answer: 124309619349406845 == 124309619349406845 |
