#include <bits/stdc++.h>
using namespace std;
#define int long long
#define pb push_back
#define all(a) a.begin(),a.end()
#define mp make_pair
#define fi first
#define se second
#define sz(a) (int)a.size()
const int maxn = (int)1e4+10;
int n, K, a[maxn], pre[maxn];
int dp[maxn][201], dp2[maxn][201], p[maxn][201];
vector<int> v; int ans = 0;
inline int sum(int i, int j) {return pre[j+1]-pre[i];}
void recur(int i, int k){
if(k) v.pb(p[i][k]), recur(p[i][k],k-1);
}
double slope(int i, int j, int k){
if(i>j) swap(i,j);
return (double)(dp2[i][k]-dp2[j][k])/(sum(0,i)-sum(0,j));
}
int32_t main()
{
ios_base::sync_with_stdio(false); cin.tie(0);
cin >> n >> K;
for(int i = 0; i < n; i++) cin >> a[i], pre[i+1]=pre[i]+a[i];
for(int i = 0; i <= n; i++)
for(int k = 0; k <= K; k++)
dp[i][k]=!!k*-100000000000000000ll, dp2[i][k] = dp[i][k]-pre[i]*pre[i];
for(int k = 1; k <= K; k++){
deque<int> dq; dq.clear(); dq.push_back(0);
for(int i = 1; i < n; i++){
while(sz(dq)>1 and slope(dq[0],dq[1],k-1) >= -sum(0,i)) dq.pop_front();
int j = dq.front();
int tot = dp[j][k-1]+sum(j+1,i)*sum(0,j);
if(dp[i][k]<tot) dp[i][k] = tot, p[i][k]=j;
dp2[i][k] = dp[i][k]-pre[i]*pre[i];
while(sz(dq)>1 and slope(dq[sz(dq)-2],dq.back(),k-1)>=slope(dq.back(),i,k-1)) dq.pop_back();
if(a[i]!=0)dq.push_back(i);
}
}
cout << dp[n-1][K] << "\n"; recur(n-1,K);
sort(all(v)); for(auto u : v) cout << u+1 << " ";
}
