1 //minamoto
 2 #include<iostream>
 3 #include<cstdio>
 4 #define ll long long
 5 using namespace std;
 6 #define getc() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2)?EOF:*p1++)
 7 char buf[1<<21],*p1=buf,*p2=buf;
 8 inline int read(){
 9     #define num ch-'0'
10     char ch;bool flag=0;int res;
11     while(!isdigit(ch=getc()))
12     (ch=='-')&&(flag=true);
13     for(res=num;isdigit(ch=getc());res=res*10+num);
14     (flag)&&(res=-res);
15     #undef num
16     return res;
17 }
18 char sr[1<<21],z[20];int C=-1,Z;
19 inline void Ot(){fwrite(sr,1,C+1,stdout),C=-1;}
20 inline void print(int x){
21     if(C>1<<20)Ot();if(x<0)sr[++C]=45,x=-x;
22     while(z[++Z]=x%10+48,x/=10);
23     while(sr[++C]=z[Z],--Z);sr[++C]=' ';
24 }
25 const int N=100005;
26 int to[205][N],q[N],n,k,h,t,r;
27 ll sum[N],dp[2][N];
28 inline double slope(int j,int k){
29     if(sum[j]==sum[k]) return 1e18;
30     return ((dp[r^1][j]-sum[j]*sum[j])-(dp[r^1][k]-sum[k]*sum[k]))*1.0/(sum[k]-sum[j]);
31 }
32 int main(){
33     //freopen("testdata.in","r",stdin);
34     n=read(),k=read();
35     for(int i=1;i<=n;++i) sum[i]=read()+sum[i-1];
36     for(int a=1;a<=k;++a){
37         r=a&1;
38         h=t=0;
39         for(int i=1;i<=n;++i){
40             while(h<t&&slope(q[h],q[h+1])<sum[i]) ++h;
41             to[a][i]=q[h];
42             dp[r][i]=dp[r^1][q[h]]+sum[q[h]]*(sum[i]-sum[q[h]]);
43             while(h<t&&slope(q[t],q[t-1])>slope(q[t-1],i)) --t;q[++t]=i;
44         }
45     }
46     printf("%lld\n",dp[k&1][n]);
47     for(int i=k,u=n;i;--i){
48         u=to[i][u];
49         print(u);
50     }
51     Ot();
52     return 0;
53 }