#include <bits/stdc++.h>
#pragma GCC optmize("Ofast")
using namespace std;
using ll = long long;
#define int long long
#define FOR(i, a, b) for (int i = a; i <= b; i++)
#define FORD(i, a, b) for (int i = b; i >= a; i --)
#define REP(i, n) for (int i = 0; i < n; ++i)
#define REPD(i, n) for (int i = n - 1; i >= 0; --i)
#define MASK(i) (1LL << (i))
#define BIT(x, i) (((x) >> (i)) & 1)
constexpr ll LINF = (1ll << 60);
constexpr int INF = (1ll << 30);
constexpr int Mod = 1e9 + 7;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
void setupIO(){
#define name "Whisper"
//Phu Trong from Nguyen Tat Thanh High School for gifted student
srand(time(NULL));
cin.tie(nullptr)->sync_with_stdio(false); cout.tie(nullptr);
//freopen(name".inp", "r", stdin);
//freopen(name".out", "w", stdout);
cout << fixed << setprecision(10);
}
template <class X, class Y>
bool minimize(X &x, const Y &y){
X eps = 1e-9;
if (x > y + eps) {x = y; return 1;}
return 0;
}
template <class X, class Y>
bool maximize(X &x, const Y &y){
X eps = 1e-9;
if (x + eps < y) {x = y; return 1;}
return 0;
}
int nArr, nGroup;
const int MAX = 1e5 + 5;
int a[MAX];
int dp[MAX][2];
int opt[MAX][205];
int s[MAX];
struct Line {
ll a, b, id;
Line (ll _a = 0, ll _b = 0, ll _id = -1) { a = _a; b = _b; id = _id; };
ll cal(ll x) { return a * x + b; }
long double cross(Line o) { return (long double) (b - o.b) / (long double) (o.a - a); }
};
struct CHT {
deque <Line> q;
void addLine(Line nLine) {
// need to change when a is increasing or decreasing
while (q.size() >= 2
&& (q.back().cross(nLine) <= q.back().cross(q[q.size() - 2])
|| (q.back().a == nLine.a && q.back().b <= nLine.b)))
q.pop_back();
q.push_back(nLine);
}
pair <ll, int> query(ll x) {
while (q.size() >= 2 && q[0].cal(x) <= q[1].cal(x))
q.pop_front();
return {q[0].cal(x), q[0].id};
}
};
void Whisper(){
cin >> nArr >> nGroup; ++nGroup;
for (int i = 1; i <= nArr; ++i) cin >> a[i], s[i] = s[i - 1] + a[i];
//s[nArr] * s[i] - s[nArr] * s[j] - s[i] * s[i] + s[i] * s[j]
//using s(j) as x we have equation
//s(j) * x + - s(nArr) * s(j) - s(i) * s(i) + s(nArr) * s(i) + dp(j, k - 1)
for (int k = 1; k <= nGroup; ++k){
CHT cht;
cht.addLine(Line(0, 0, 0));
for (int i = 1; i <= nArr; ++i){
pair<int, int> ret = cht.query(s[i]);
dp[i][1] = ret.first + s[nArr] * s[i] - s[i] * s[i];
opt[i][k] = ret.second;
cht.addLine(Line(s[i], -s[i] * s[nArr] + dp[i][0], i));
}
for (int i = 1; i <= nArr; ++i){
dp[i][0] = dp[i][1];
}
}
cout << dp[nArr][0] << '\n';
vector<int> ans;
int current = nArr;
while(nGroup > 0){
if (current != nArr)
ans.push_back(current);
current = opt[current][nGroup];
nGroup--;
}
reverse(ans.begin(), ans.end());
for (int&v : ans) cout << v << " ";
}
signed main(){
setupIO();
int Test = 1;
// cin >> Test;
for ( int i = 1 ; i <= Test ; i++ ){
Whisper();
if (i < Test) cout << '\n';
}
}
