#include<bits/stdc++.h>
#define fi first
#define se second
using namespace std;
typedef long long ll;
typedef vector<ll> vi;
typedef vector<ll> vl;
const int N=1e5+10;
deque<int> deq[201];
pair<ll,int> dp[N][201];
int sp[N],t[N];
ll wz(int j,int i,int id){
return dp[j][id].fi-(ll)sp[j]*(ll)sp[j]+(ll)sp[j]*(ll)sp[i];
}
void del(int id,int i){
while(deq[id].size()>=1){
int p=deq[id].front();
deq[id].pop_front();
int d=deq[id].front();
if(wz(p,i,id)>wz(d,i,id)){
deq[id].push_front(p);
break;
}
}
}
void dod(int id,int i){
while(deq[id].size()>=1){
int d=deq[id].back();
if(wz(i,i,id)<wz(d,i,id)) break;
deq[id].pop_back();
}
deq[id].push_back(i);
}
void solve(){
int n,k;
cin>>n>>k;
for(int i=1;i<=n;i++){
cin>>t[i];
sp[i]=sp[i-1]+t[i];
}
deq[0].push_back(0);
for(int i=1;i<=n;i++){
for(int j=min(k,i);j>=1;j--){
del(j-1,i);
dp[i][j]={wz(deq[j-1].front(),i,j-1),deq[j-1].front()};
deq[j].push_back(i);
dod(j,i);
}
dod(0,i);
}
cout<<dp[n][k].fi<<"\n";
int curr=n;
for(int i=k;i>=1;i--){
curr=dp[curr][i].se;
cout<<curr<<" ";
}
cout<<"\n";
}
int main(){
solve();
}
