#include<stdio.h>
#include<deque>
#define sq(a) ((a)*(a))
#define sik(l,x) (-(l.a)*(x)+(l.b))
using namespace std;
typedef long long lld;
struct lin {
int ix;
lld a, b; // -ax+b
}im;
deque<lin> dq;
int n, k, di[10010][202];
lld ba[100100], dy[10010][202];
int main(){
int i, j, t=1;
scanf("%d%d", &n, &k);
for(i=1; i<=n; i++){
scanf("%lld", &ba[i]), ba[i]+=ba[i-1];
dy[i][0]=sq(ba[i]);
}
for(j=1; j<=k; j++){
im.a=2*ba[j], im.b=dy[j][j-1]+sq(ba[j]), im.ix=j;
dq.push_back(im);
for(i=1; i<=n; i++)dy[i][t]=0;
for(i=j+1; i<=n; i++){
for(; dq.size()>=2;){
if(sik(dq[0],ba[i])<sik(dq[1],ba[i]))break;
dq.pop_front();
}
di[i][j]=dq[0].ix, dy[i][j]=sq(ba[i])+sik(dq[0],ba[i]);
im.ix=i, im.a=2*ba[i], im.b=dy[i][j-1]+sq(ba[i]);
for(; dq.size();){
if(dq[dq.size()-1].b<im.b)break;
dq.pop_back();
}
dq.push_back(im);
}
dq.clear();
t=1-t;
}
printf("%lld\n", (sq(ba[n])-dy[n][k])/2);
for(i=n, j=k; j>0; j--)printf("%d ", di[i][j]), i=di[i][j];
return 0;
}
