// source: https://oj.uz/problem/view/APIO14_sequence
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ar array
const int mxN = 100001;
int n, k, a[mxN];
ll pre[mxN];
int last[mxN][201];
struct Line {
ll m, b, ind;
ll eval(ll x) {return m * x + b;}
};
bool isect(Line& a, Line& b, Line& c) { // is intersection of (a, c) < (b, c)
return (a.b - c.b) * (c.m - b.m) < (b.b - c.b) * (c.m - a.m);
}
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cin >> n >> k;
for (int i = 1; i <= n; ++i) {
cin >> a[i];
pre[i] = pre[i - 1] + a[i];
}
vector<ll> dp(n + 1);
vector<ll> dpn(n + 1);
for (int i = 1; i <= n; ++i) {
dp[i] = pre[i] * (pre[n] - pre[i]);
}
for (int rep = 2; rep <= k; ++rep) {
deque<Line> dq;
for (int i = rep; i < n; ++i) {
Line cur = {pre[i - 1], dp[i - 1] - pre[n] * pre[i - 1], i - 1};
while(dq.size() >= 2 && isect(cur, dq.back(), dq.end()[-2]))
dq.pop_back();
dq.push_back(cur);
while(dq.size() >= 2 && dq[1].eval(pre[i]) > dq[0].eval(pre[i]))
dq.pop_front();
dpn[i] = pre[i] * (pre[n] - pre[i]) + dq[0].eval(pre[i]);
last[i][rep] = dq[0].ind;
}
swap(dp, dpn);
}
int ind = max_element(dp.begin() + k, dp.end()) - dp.begin();
cout << dp[ind] << "\n";
for (int i = k; i >= 1; --i) {
cout << ind << " ";
ind = last[ind][i];
}
return 0;
}
// notes
// dp[i] = dp[j] + (pre[i] - pre[j]) * (pre[n] - pre[i]);
// dp[i] = pre[i] * (pre[n] - pre[i]) + max(pre[j] * pre[i] + dp[j] - pre[n] * pre[j])
