#include <bits/stdc++.h>
#define int long long
#define ll long long
#define line pair <int, ll>
#define Point pair <ll, ll>
#define A first
#define B second
#define pb push_back
using namespace std;
const int N = 1e5 + 5;
const ll inf = 1e18;
int n, k;
int a[N], pre[N], best[205][N];
ll dp[2][N];
vector <line> st;
vector <int> idx;
Point giao(line l1, line l2, ll &del){
Point ans;
del = l1.A - l2.A;
ans.A = (l2.B - l1.B);
ans.B = ans.A * l1.A + l1.B * del;
return ans;
}
void add(line p, int id){
if (st.empty()){
st.pb(p);
idx.pb(id);
return;
}
while (p == st.back()) return;
while (true){
int sz = st.size();
if (sz <= 1) break;
line l2 = st.back();
line l3 = st[sz - 2];
ll del = 0;
Point k = giao(p, l3, del);
if (k.A * l2.A + l2.B * del > k.B) break;
st.pop_back();
idx.pop_back();
}
st.pb(p);
idx.pb(id);
}
int get(int &cur, int t, int i){
int sz = st.size();
cur = min(cur, sz - 1);
dp[t][i] = st[cur].A * pre[i] + st[cur].B;
while (cur < sz - 1){
ll val = st[cur + 1].A * pre[i] + st[cur + 1].B;
if (dp[t][i] < val){
dp[t][i] = val;
++ cur;
}
else return idx[cur];
}
return idx[cur];
}
void solve(){
cin >> n >> k;
for (int i = 1; i <= n; ++ i){
cin >> a[i];
pre[i] = pre[i - 1] + a[i];
}
for (int loops = 1; loops <= k; ++ loops){
st.clear();
idx.clear();
int t = loops & 1;
int cur = 0;
for (int i = 1; i <= n; ++ i){
if (i == loops){
add(line(pre[i], dp[1 ^ t][i] - pre[i] * pre[i]), i);
best[loops][i] = i;
}
if (i > loops){
dp[t][i] = inf;
best[loops][i] = get(cur, t, i);
add(line(pre[i], dp[1 ^ t][i] - pre[i] * pre[i]), i);
//cout << loops << ' ' << i << ' ' << dp[t][i] << endl;
}
}
}
cout << dp[k & 1][n] << '\n';
int cur = n;
for (int i = k; i >= 1; -- i){
cur = best[i][cur];
cout << cur << ' ';
}
}
signed main(){
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
solve();
return 0;
}
