#include <bits/stdc++.h>
using namespace std;
#define forinc(a, b, c) for(int a=b, _c=c; a<=_c; ++a)
#define fordec(a, b, c) for(int a=b, _c=c; a>=_c; --a)
#define forv(a, b) for(auto &a : b)
#define rep(i, n) forinc(i, 1, n)
#define repv(i, n) forinc(i, 0, n - 1)
#define ii pair<int,int>
#define fi first
#define se second
#define all(a) begin(a), end(a)
#define reset(f, x) memset(f, x, sizeof(f))
#define eb emplace_back
#define pb push_back
const int N=1e5+5;
long long n,a[N];
long long f[2][N];
int k;
int pre[202][N];
int top;
long long s[N],x[N];
struct line{long long x,y;int id;} li[N];
double q[N];
double G(line x,line y){return 1.0*(x.y-y.y)/(y.x-x.x);}
bool ok(line p){
if(p.x==li[top].x) return false;
if(top==1) return 1;
double x1=G(p,li[top]);
double x2=G(p,li[top-1]);
return x1>x2;
}
signed main(){
ios_base::sync_with_stdio(false);
cin.tie(0); cout.tie(0);
if(fopen("input.txt", "r")) freopen("input.txt", "r", stdin);
cin>>n>>k;
forinc(i,1,n) cin>>a[i], s[i]=s[i-1]+a[i];
fordec(i,n,1) x[i]=x[i+1]+a[i];
forinc(i,1,k){
int u=i&1;
top=0;
li[++top]={s[i-1],f[u^1][i-1],i-1};
q[top]=-1e15;
forinc(j,i,n-1){
int l=1, r=top, z=0;
while(l<=r) {
int mid=l+(r-l)/2;
if(q[mid]<=-x[j+1]) z=mid, l=mid+1;
else r=mid-1;
}
f[u][j]=s[j]*x[j+1]-li[z].x*x[j+1]+li[z].y;
pre[i][j]=li[z].id;
line uu;
uu.x=s[j], uu.y=f[u^1][j], uu.id=j;
if(uu.x==li[top].x && uu.y>=li[top].y) continue;
while(top && !ok(uu)) top--;
li[++top]=uu;
if(top>1) q[top]=G(li[top],li[top-1]);
}
}
int now=0;
forinc(i,1,n-1) if(f[k&1][now]<=f[k&1][i]) now=i;
cout<<f[k&1][now]<<'\n';
vector<int> ans; ans.pb(now);
fordec(i,k,2) ans.pb(pre[i][now]), now=pre[i][now];
reverse(all(ans));
forv(v, ans) cout<<v<<' ';
}
Compilation message
sequence.cpp: In function 'int main()':
sequence.cpp:40:40: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
if(fopen("input.txt", "r")) freopen("input.txt", "r", stdin);
~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
0 ms |
384 KB |
contestant found the optimal answer: 108 == 108 |
| 2 |
Correct |
0 ms |
384 KB |
contestant found the optimal answer: 999 == 999 |
| 3 |
Correct |
0 ms |
384 KB |
contestant found the optimal answer: 0 == 0 |
| 4 |
Correct |
1 ms |
384 KB |
contestant found the optimal answer: 1542524 == 1542524 |
| 5 |
Correct |
0 ms |
384 KB |
contestant found the optimal answer: 4500000000 == 4500000000 |
| 6 |
Correct |
0 ms |
384 KB |
contestant found the optimal answer: 1 == 1 |
| 7 |
Correct |
0 ms |
384 KB |
contestant found the optimal answer: 1 == 1 |
| 8 |
Correct |
0 ms |
384 KB |
contestant found the optimal answer: 1 == 1 |
| 9 |
Correct |
0 ms |
384 KB |
contestant found the optimal answer: 100400096 == 100400096 |
| 10 |
Correct |
0 ms |
384 KB |
contestant found the optimal answer: 900320000 == 900320000 |
| 11 |
Correct |
1 ms |
384 KB |
contestant found the optimal answer: 3698080248 == 3698080248 |
| 12 |
Correct |
0 ms |
384 KB |
contestant found the optimal answer: 3200320000 == 3200320000 |
| 13 |
Correct |
1 ms |
384 KB |
contestant found the optimal answer: 140072 == 140072 |
| 14 |
Correct |
0 ms |
384 KB |
contestant found the optimal answer: 376041456 == 376041456 |
| 15 |
Correct |
0 ms |
384 KB |
contestant found the optimal answer: 805 == 805 |
| 16 |
Correct |
1 ms |
384 KB |
contestant found the optimal answer: 900189994 == 900189994 |
| 17 |
Correct |
0 ms |
384 KB |
contestant found the optimal answer: 999919994 == 999919994 |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
0 ms |
384 KB |
contestant found the optimal answer: 1093956 == 1093956 |
| 2 |
Correct |
1 ms |
384 KB |
contestant found the optimal answer: 302460000 == 302460000 |
| 3 |
Correct |
1 ms |
640 KB |
contestant found the optimal answer: 122453454361 == 122453454361 |
| 4 |
Correct |
0 ms |
384 KB |
contestant found the optimal answer: 93663683509 == 93663683509 |
| 5 |
Correct |
0 ms |
384 KB |
contestant found the optimal answer: 1005304678 == 1005304678 |
| 6 |
Correct |
0 ms |
384 KB |
contestant found the optimal answer: 933702 == 933702 |
| 7 |
Correct |
1 ms |
512 KB |
contestant found the optimal answer: 25082842857 == 25082842857 |
| 8 |
Correct |
1 ms |
384 KB |
contestant found the optimal answer: 687136 == 687136 |
| 9 |
Correct |
0 ms |
384 KB |
contestant found the optimal answer: 27295930079 == 27295930079 |
| 10 |
Correct |
0 ms |
384 KB |
contestant found the optimal answer: 29000419931 == 29000419931 |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
0 ms |
384 KB |
contestant found the optimal answer: 610590000 == 610590000 |
| 2 |
Correct |
0 ms |
384 KB |
contestant found the optimal answer: 311760000 == 311760000 |
| 3 |
Correct |
1 ms |
1408 KB |
contestant found the optimal answer: 1989216017013 == 1989216017013 |
| 4 |
Correct |
1 ms |
384 KB |
contestant found the optimal answer: 1499437552673 == 1499437552673 |
| 5 |
Correct |
1 ms |
1152 KB |
contestant found the optimal answer: 1019625819 == 1019625819 |
| 6 |
Correct |
1 ms |
1280 KB |
contestant found the optimal answer: 107630884 == 107630884 |
| 7 |
Correct |
2 ms |
1408 KB |
contestant found the optimal answer: 475357671774 == 475357671774 |
| 8 |
Correct |
1 ms |
640 KB |
contestant found the optimal answer: 193556962 == 193556962 |
| 9 |
Correct |
1 ms |
512 KB |
contestant found the optimal answer: 482389919803 == 482389919803 |
| 10 |
Correct |
1 ms |
640 KB |
contestant found the optimal answer: 490686959791 == 490686959791 |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
1 ms |
512 KB |
contestant found the optimal answer: 21503404 == 21503404 |
| 2 |
Correct |
1 ms |
512 KB |
contestant found the optimal answer: 140412195 == 140412195 |
| 3 |
Correct |
6 ms |
2048 KB |
contestant found the optimal answer: 49729674225461 == 49729674225461 |
| 4 |
Correct |
0 ms |
512 KB |
contestant found the optimal answer: 37485571387523 == 37485571387523 |
| 5 |
Correct |
8 ms |
2048 KB |
contestant found the optimal answer: 679388326 == 679388326 |
| 6 |
Correct |
7 ms |
1792 KB |
contestant found the optimal answer: 4699030287 == 4699030287 |
| 7 |
Correct |
8 ms |
2048 KB |
contestant found the optimal answer: 12418819758185 == 12418819758185 |
| 8 |
Correct |
6 ms |
2176 KB |
contestant found the optimal answer: 31093317350 == 31093317350 |
| 9 |
Correct |
2 ms |
768 KB |
contestant found the optimal answer: 12194625429236 == 12194625429236 |
| 10 |
Correct |
4 ms |
1152 KB |
contestant found the optimal answer: 12345131038664 == 12345131038664 |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
3 ms |
1152 KB |
contestant found the optimal answer: 1818678304 == 1818678304 |
| 2 |
Correct |
2 ms |
1152 KB |
contestant found the optimal answer: 1326260195 == 1326260195 |
| 3 |
Correct |
69 ms |
9808 KB |
contestant found the optimal answer: 4973126687469639 == 4973126687469639 |
| 4 |
Correct |
2 ms |
1152 KB |
contestant found the optimal answer: 3748491676694116 == 3748491676694116 |
| 5 |
Correct |
54 ms |
6264 KB |
contestant found the optimal answer: 1085432199 == 1085432199 |
| 6 |
Correct |
72 ms |
7160 KB |
contestant found the optimal answer: 514790755404 == 514790755404 |
| 7 |
Correct |
76 ms |
7548 KB |
contestant found the optimal answer: 1256105310476641 == 1256105310476641 |
| 8 |
Correct |
60 ms |
6392 KB |
contestant found the optimal answer: 3099592898816 == 3099592898816 |
| 9 |
Correct |
58 ms |
7160 KB |
contestant found the optimal answer: 1241131419367412 == 1241131419367412 |
| 10 |
Correct |
77 ms |
8952 KB |
contestant found the optimal answer: 1243084101967798 == 1243084101967798 |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
22 ms |
7928 KB |
contestant found the optimal answer: 19795776960 == 19795776960 |
| 2 |
Correct |
22 ms |
7936 KB |
contestant found the optimal answer: 19874432173 == 19874432173 |
| 3 |
Correct |
792 ms |
85692 KB |
contestant found the optimal answer: 497313449256899208 == 497313449256899208 |
| 4 |
Correct |
24 ms |
8568 KB |
contestant found the optimal answer: 374850090734572421 == 374850090734572421 |
| 5 |
Correct |
980 ms |
85016 KB |
contestant found the optimal answer: 36183271951 == 36183271951 |
| 6 |
Correct |
853 ms |
61688 KB |
contestant found the optimal answer: 51629847150471 == 51629847150471 |
| 7 |
Correct |
788 ms |
66240 KB |
contestant found the optimal answer: 124074747024496432 == 124074747024496432 |
| 8 |
Correct |
727 ms |
55176 KB |
contestant found the optimal answer: 309959349080800 == 309959349080800 |
| 9 |
Correct |
653 ms |
61944 KB |
contestant found the optimal answer: 124113525649823701 == 124113525649823701 |
| 10 |
Correct |
835 ms |
77560 KB |
contestant found the optimal answer: 124309619349406845 == 124309619349406845 |
