#line 2 "/Users/kaage/Desktop/ProgrammingWorkspace/library/other/template.hpp"
#define _CRT_SECURE_NO_WARNINGS
#pragma target("avx2")
#pragma optimize("O3")
#pragma optimize("unroll-loops")
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <memory>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <string.h>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
#define rep(i,n) for(int i=0;i<(n);i++)
#define REP(i,n) for(int i=1;i<=(n);i++)
#define all(V) V.begin(),V.end()
typedef long long lint;
typedef unsigned long long ulint;
typedef std::pair<int, int> P;
typedef std::pair<lint, lint> LP;
constexpr int INF = INT_MAX/2;
constexpr lint LINF = LLONG_MAX/2;
constexpr double eps = DBL_EPSILON;
constexpr double PI=3.141592653589793238462643383279;
template<class T>
class prique :public std::priority_queue<T, std::vector<T>, std::greater<T>> {};
template <class T, class U>
inline bool chmax(T& lhs, const U& rhs) {
if (lhs < rhs) {
lhs = rhs;
return 1;
}
return 0;
}
template <class T, class U>
inline bool chmin(T& lhs, const U& rhs) {
if (lhs > rhs) {
lhs = rhs;
return 1;
}
return 0;
}
inline lint gcd(lint a, lint b) {
while (b) {
lint c = a;
a = b; b = c % b;
}
return a;
}
inline lint lcm(lint a, lint b) {
return a / gcd(a, b) * b;
}
bool isprime(lint n) {
if (n == 1)return false;
for (int i = 2; i * i <= n; i++) {
if (n % i == 0)return false;
}
return true;
}
template<typename T>
T mypow(T a, lint b) {
T res(1);
while(b){
if(b&1)res*=a;
a*=a;
b>>=1;
}
return res;
}
lint modpow(lint a, lint b, lint m) {
lint res(1);
while(b){
if(b&1){
res*=a;res%=m;
}
a*=a;a%=m;
b>>=1;
}
return res;
}
template<typename T>
void printArray(std::vector<T>& vec) {
rep(i, vec.size()){
std::cout << vec[i];
std::cout<<(i==(int)vec.size()-1?"\n":" ");
}
}
template<typename T>
void printArray(T l, T r) {
T rprev = std::prev(r);
for (T i = l; i != rprev; i++) {
std::cout << *i << " ";
}
std::cout << *rprev << std::endl;
}
LP extGcd(lint a,lint b) {
if(b==0)return {1,0};
LP s=extGcd(b,a%b);
std::swap(s.first,s.second);
s.second-=a/b*s.first;
return s;
}
LP ChineseRem(const lint& b1,const lint& m1,const lint& b2,const lint& m2) {
lint p=extGcd(m1,m2).first;
lint tmp=(b2-b1)*p%m2;
lint r=(b1+m1*tmp+m1*m2)%(m1*m2);
return std::make_pair(r,m1*m2);
}
/*template<typename F>
inline constexpr decltype(auto) lambda_fix(F&& f){
return [f=std::forward<F>(f)](auto&&... args){
return f(f,std::forward<decltype(args)>(args)...);
};
}*/
#line 2 "/Users/kaage/Desktop/ProgrammingWorkspace/library/data-structure/MonotoneConvexHullTrick.hpp"
template<typename T,bool isMin>
class MonotoneConvexHullTrick{
static constexpr double INF=DBL_MAX;
using TP=std::pair<std::pair<T,T>,int>;
int index=0;
std::deque<TP> deq;
inline int sgn(T x){return x==0?0:(x<0?-1:1);}
inline T eval(const TP& a,const T& x){return a.first.first*x+a.first.second;}
inline bool bad(const TP& l1,const TP& l2,const TP& l3){
if(l1.first.second==l2.first.second||l2.first.second==l3.first.second){
return sgn(l2.first.first-l1.first.first)*sgn(l3.first.second-l2.first.second)>=sgn(l3.first.first-l2.first.first)*sgn(l2.first.second-l1.first.second);
}
return (double)(l2.first.first-l1.first.first)*sgn(l3.first.second-l2.first.second)/std::abs(l2.first.second-l1.first.second)
>=(double)(l3.first.first-l2.first.first)*sgn(l2.first.second-l1.first.second)/std::abs(l3.first.second-l2.first.second);
}
public:
void addLine(T m,T b){
if(!isMin)m=-m;b=-b;
TP line={{m,b},index++};
if(empty()){
deq.emplace_front(line);
return;
}
if(deq.front().first.first<=m){
if(deq.front().first.first==m){
if(deq.front().first.second<=b)return;
deq.pop_front();
}
while(deq.size()>=2&&bad(line,deq[0],deq[1]))deq.pop_front();
deq.emplace_front(line);
}
else{
if(deq.back().first.first==m){
if(deq.back().first.second<=b)return;
deq.pop_back();
}
while(deq.size()>=2&&bad(deq[deq.size()-2],deq.back(),line))deq.pop_back();
deq.emplace_back(line);
}
}
std::pair<T,int> query(T x){
int l=-1,r=deq.size()-1;
while(l+1<r){
int m=(l+r)/2;
if(eval(deq[m],x)>=eval(deq[m+1],x))l=m;
else r=m;
}
return {(isMin?1:-1)*eval(deq[r],x),deq[r].second};
}
std::pair<T,int> queryMonotoneInc(T x){
while(deq.size()>=2&&eval(deq[0],x)>=eval(deq[1],x))deq.pop_front();
return {(isMin?1:-1)*eval(deq[0],x),deq[0].second};
}
std::pair<T,int> queryMonotoneDec(T x){
while(deq.size()>=2&&eval(deq.back(),x)>=eval(deq[deq.size()-2]))deq.pop_back();
return {(isMin?1:-1)*eval(deq.back(),x),deq.back().second};
}
bool empty()const{return deq.empty();}
void clear(){deq.clear();index=0;}
};
#line 3 "main.cpp"
int n,k,a[100010];
lint b[100010],dp[2][100010];
int from[210][100010];
int main(){
scanf("%d%d",&n,&k);
rep(i,n){
scanf("%d",a+i);
b[i]=a[i];
if(i)b[i]+=b[i-1];
}
MonotoneConvexHullTrick<lint,false> cht;
rep(i,k){
cht.clear();
for(int j=i+1;j<n;j++){
cht.addLine(b[j-1],dp[0][j-1]-b[j-1]*b[j-1]);
auto p=cht.queryMonotoneInc(b[j]);
from[i][j]=p.second+i;
dp[1][j]=p.first;
}
std::move(dp[1],dp[1]+n,dp[0]);
std::fill(dp[1],dp[1]+n,0);
}
std::vector<int> vec;
int now=n-1;
for(int i=k-1;i>=0;i--){
now=from[i][now];
vec.push_back(now+1);
}
std::reverse(all(vec));
printf("%lld\n",dp[0][n-1]);
printArray(vec);
}
