#include <bits/stdc++.h>
#define MAXK 210
#define MAXN 100010
#define INF 1000000000000000000LL
using namespace std;
typedef long long int lli;
typedef pair<int,int> pii;
class ConvexHullTrick
{
public:
bool canRemove(lli a, lli b, lli c, lli d)
{
double aa = (double) a;
double cc = (double) c;
return aa/b <= cc/d;
}
void add(lli a, lli b, int i)
{
//printf("ADD %lld %lld\n",a,b);
while(sz > 1 && canRemove(B[sz] - b , a - A[sz] , B[sz - 1] - B[sz] , A[sz] - A[sz - 1]))
{
A.pop_back();
B.pop_back();
ind.pop_back();
//printf("POP\n");
sz--;
}
sz++;
A.push_back( a );
B.push_back( b );
ind.push_back( i );
}
lli getFunction(int i, lli x) { return A[i]*x + B[i]; }
lli query(int x)
{
if(opt > sz) opt = sz;
while(opt < sz && getFunction(opt , x) <= getFunction(opt + 1 , x)) opt++;
return ind[ opt ];
}
void clear()
{
A.clear(); B.clear();
ind.clear();
sz = -1;
opt = 0;
}
ConvexHullTrick() : sz( -1 ), opt( 0 ) {}
private:
int sz;
int opt;
vector<lli> A;
vector<lli> B;
vector<int> ind;
};
int n, k;
int v[MAXN];
int opt[MAXN][MAXK];
lli sv[MAXN];
lli dp[MAXN][2];
ConvexHullTrick CHT;
int main()
{
scanf("%d %d",&n,&k);
for(int g = 1 ; g <= n ; g++)
{
scanf("%d",&v[g]);
sv[g] = sv[g - 1] + v[g];
}
//dp[0][0] = dp[0][1] = -INF;
/*for(int i = 0 ; i <= n ; i++)
dp[i][i%2] = -INF;*/
//dp[1][0] = 0;
for(int j = 1 ; j <= k ; j++)
{
CHT.add(sv[j] , dp[j][1 - j%2] -sv[j]*sv[j], j);
//printf("ADD %d %lld\n",sv[j],dp[j][1-j%2]-sv[j]*sv[j]);
for(int i = j + 1 ; i <= n ; i++)
{
int& l = opt[i][j];
opt[i][j] = CHT.query( sv[i] );
dp[i][j%2] = dp[ l ][1 - j%2] - sv[l]*sv[l] + sv[l]*sv[i];
//printf("dp(%d,%d) = %lld %d %lld\n",i,j,dp[i][j%2],l,dp[i][1 - (j%2)]);
CHT.add(sv[i] , dp[i][1 - j%2] - sv[i]*sv[i] , i);
//printf("ADD %lld %lld\n",sv[i],dp[i][1-j%2]-sv[i]*sv[i]);
}
//printf("\n\n");
CHT.clear();
}
printf("%lld\n",dp[n][k%2]);
int cur = n;
for(int i = k ; i > 0 ; i--)
{
printf("%d ",opt[cur][i]);
cur = opt[cur][i];
}
}
//dp(i,k) = dp(j - 1 , k) + sv[j - 1]*(sv[i] - sv[j - 1]) = dp(j - 1 , k) - (sv[j - 1]*sv[j - 1]) + (sv[j - 1]*sv[i])
