#include <bits/stdc++.h>
using namespace std;
#define fr first
#define sc second
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
int n, k, opt[100002][202], ps[100069];
const double eps = 1e-18;
vector<int> vc;
long long dp[100069][2];
bool lessThan(double a, double b)
{
return b-a>eps;
}
bool mantap(long long c1, int m1, long long c2, int m2, long long c3, int m3)
{
return (m2!=m3) && 1ll*(c1-c2)*1ll*(m3-m2)<1ll*(c2-c3)*1ll*(m2-m1);
}
long long calc(int id1, int id2, int c)
{
return dp[id1][c%2]+1ll*(ps[id2]-ps[id1])*ps[id1];
}
long long calc_c(int id, int c)
{
return dp[id][c%2]-1ll*ps[id]*ps[id];
}
int main()
{
int i, j, c;
scanf("%d%d", &n, &k);
k++;
for (i=1; i<=n; i++)
{
scanf("%d", ps+i);
ps[i] += ps[i-1];
dp[i][0] = -1e15;
}
for (c=1; c<=k; c++)
{
dp[0][c%2] = -1e15;
for (i=1, j=0; i<=n; i++)
{
vc.push_back(i-1);
for (; j+1<vc.size() && calc(vc[j], i, c-1)<calc(vc[j+1], i, c-1); j++);
j = min(j, (int)vc.size()-1);
opt[i][c] = vc[j];
dp[i][c%2] = calc(vc[j], i, c-1);
for (; vc.size()>=2 && !mantap(calc_c(vc.size()-2, c-1), ps[vc.size()-2], calc_c(vc.back(), c-1), ps[vc.back()], calc_c(i, c-1), ps[i]); vc.pop_back());
}
}
printf("%lld\n", dp[n][k%2]);
for (i=n, c=k; c>=2; i=opt[i][c], c--)
{
printf("%d ", opt[i][c]);
}
printf("\n");
}
