/*
. . , ,
|` \/ \/ \,',
; ` \/\,.
: ` \,/
| /
; :
: ;
| ,---. /
: ,' `,-._ \
; ( o \ `'
_: . ,' o ;
/,.` `.__,'`-.__,
\_ _ \
,' / `, `.,'
___,'`-._ \_/ `,._ ;
__;_,' `-.`-'./ `--.____)
,-' _,--\^-'
,:_____ ,-' \
(,' `--. \;-._ ;
: Y `-/ `, :
: : : /_;'
: : | :
\ \ : :
`-._ `-.__, \ `.
\ \ `. \ `.
,-; \---)_\ ,','/
\_ `---'--'" ,'^-;'
(_` ---'" ,-')
/ `--.__,. ,-' \
-hrr- )-.__,-- ||___,--' `-.
/._______,|__________,'\
`--.____,'|_________,-'
__
_ ,___,-'",-=-.
__,-- _ _,-'_)_ (""`'-._\ `.
_,' __ |,' ,-' __) ,- /. |
,'_,--' | -' _)/ `\
,',' ,' ,-'_,` :
,' ,-' ,(,-( :
,' ,-' , _ ;
/ ,-._/`---' /
/ (____)(----. ) ,'
/ ( `.__, /\ /,
: ;-.___ /__\/|
| ,' `--. -,\ |
: / \ .__/
\ (__ \ |_
\ ,`-, * / _|,\
\ ,' `-. ,'_,-' \
(_\,-' ,'\")--,'-' __\
\ / // ,'| ,--' `-.
`-. `-/ \' | _,' `.
`-._ / `--'/ \
-hrr- ,' | \
/ | \
,-' | /
/ | -'
*/
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp> // Common file
#include <ext/pb_ds/tree_policy.hpp> // Including
using namespace __gnu_pbds;
using namespace std;
typedef long long int ll;
//typedef __int128_t bigint;
typedef pair<int, int> pi;
typedef pair<ll, ll> pl;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<vi> vvi;
typedef vector<vl> vvl;
typedef vector<pi> vpi;
typedef vector<pl> vpl;
typedef vector<vpi> vvpi;
typedef vector<vpl> vvpl;
typedef set<int> si;
typedef multiset<int> msi;
typedef set<ll> sl;
typedef multiset<ll> msl;
typedef tree<
pl,
null_type,
less<pl>,
rb_tree_tag,
tree_order_statistics_node_update>
ordered_set;
typedef long double ld;
#define clrcin cin.ignore(numeric_limits<streamsize>::max(),'\n');
#define GOGOGO ios::sync_with_stdio(false); cin.tie(nullptr);
#define BYEBYE return 0;
#define all(cn) (cn).begin(), (cn).end()
#define rep(i, n) for (int i = 0; i < n; ++i)
#define repk(i, k, n) for(int i = k; i < n; ++i)
#define mp make_pair
#define pb push_back
#define fi first
#define se second
#define popcnt __builtin_popcount
#define gcd std::__detail::__gcd
#define lcm std::__detail::__lcm
//const int INFI = 1e9 + 5;
const ll INFL = 4e18 + 5;
template<class T> using func = function<T>;
/************************************ general.hpp begin ************************************/
namespace CompetitiveProgramming
{
using bigint = long long int;
using ll = long long int;
using ftype = long double;
using ld = long double;
namespace IO
{
template<class ElementType> inline void output_array(ElementType* array, uint32_t size)
{
if(size)
{
cout << *array++;
size--;
while(size)
{
cout << ' ' << *array++;
--size;
}
}
cout << '\n';
}
template<class Iterator> inline void output_iterator_range(Iterator begin, const Iterator& end)
{
if(begin != end)
{
cout << *begin++;
while(begin != end)
{
cout << ' ' << *begin++;
}
}
cout << '\n';
}
template<class Container> inline void output_container(const Container& container)
{
output_iterator_range(container.begin(), container.end());
}
template<class ElementType> inline void read_array(ElementType* array, uint32_t size)
{
while(size)
{
cin >> *array++;
--size;
}
}
template<class Iterator> inline void read_iterator_range(Iterator begin, const Iterator& end)
{
while(begin != end)
{
cin >> *begin++;
}
}
template<class Container> inline void read_container(Container& container) // I dont think this will work for set etc, only std::array, std::vector etc
{
read_iterator_range(container.begin(), container.end());
}
}
}
using namespace CompetitiveProgramming;
using namespace IO;
/************************************ general.hpp end ************************************/
/************************************ math/modint.hpp begin ************************************/
namespace CompetitiveProgramming
{
namespace Math
{
template <typename T>
T inverse(T a, T m) {
T u = 0, v = 1;
while (a != 0) {
T t = m / a;
m -= t * a; swap(a, m);
u -= t * v; swap(u, v);
}
assert(m == 1);
return u;
}
template <typename T>
class Modular {
public:
using Type = typename decay<decltype(T::value)>::type;
constexpr Modular() : value() {}
template <typename U>
Modular(const U& x) {
value = normalize(x);
}
template <typename U>
static Type normalize(const U& x) {
Type v;
if (-mod() <= x && x < mod()) v = static_cast<Type>(x);
else v = static_cast<Type>(x % mod());
if (v < 0) v += mod();
return v;
}
const Type& operator()() const { return value; }
template <typename U>
explicit operator U() const { return static_cast<U>(value); }
constexpr static Type mod() { return T::value; }
Modular& operator+=(const Modular& other) { if ((value += other.value) >= mod()) value -= mod(); return *this; }
Modular& operator-=(const Modular& other) { if ((value -= other.value) < 0) value += mod(); return *this; }
template <typename U> Modular& operator+=(const U& other) { return *this += Modular(other); }
template <typename U> Modular& operator-=(const U& other) { return *this -= Modular(other); }
Modular& operator++() { return *this += 1; }
Modular& operator--() { return *this -= 1; }
Modular operator++(int) { Modular result(*this); *this += 1; return result; }
Modular operator--(int) { Modular result(*this); *this -= 1; return result; }
Modular operator-() const { return Modular(-value); }
template <typename U = T>
typename enable_if<is_same<typename Modular<U>::Type, int>::value, Modular>::type& operator*=(const Modular& rhs) {
#ifdef _WIN32
uint64_t x = static_cast<int64_t>(value) * static_cast<int64_t>(rhs.value);
uint32_t xh = static_cast<uint32_t>(x >> 32), xl = static_cast<uint32_t>(x), d, m;
asm(
"divl %4; \n\t"
: "=a" (d), "=d" (m)
: "d" (xh), "a" (xl), "r" (mod())
);
value = m;
#else
value = normalize(static_cast<int64_t>(value) * static_cast<int64_t>(rhs.value));
#endif
return *this;
}
template <typename U = T>
typename enable_if<is_same<typename Modular<U>::Type, int64_t>::value, Modular>::type& operator*=(const Modular& rhs) {
int64_t q = static_cast<int64_t>(static_cast<long double>(value) * rhs.value / mod());
value = normalize(value * rhs.value - q * mod());
return *this;
}
template <typename U = T>
typename enable_if<!is_integral<typename Modular<U>::Type>::value, Modular>::type& operator*=(const Modular& rhs) {
value = normalize(value * rhs.value);
return *this;
}
Modular& operator/=(const Modular& other) { return *this *= Modular(inverse(other.value, mod())); }
template <typename U>
friend bool operator==(const Modular<U>& lhs, const Modular<U>& rhs);
template <typename U>
friend bool operator<(const Modular<U>& lhs, const Modular<U>& rhs);
template <typename U>
friend std::istream& operator>>(std::istream& stream, Modular<U>& number);
private:
Type value;
};
template <typename T> bool operator==(const Modular<T>& lhs, const Modular<T>& rhs) { return lhs.value == rhs.value; }
template <typename T, typename U> bool operator==(const Modular<T>& lhs, U rhs) { return lhs == Modular<T>(rhs); }
template <typename T, typename U> bool operator==(U lhs, const Modular<T>& rhs) { return Modular<T>(lhs) == rhs; }
template <typename T> bool operator!=(const Modular<T>& lhs, const Modular<T>& rhs) { return !(lhs == rhs); }
template <typename T, typename U> bool operator!=(const Modular<T>& lhs, U rhs) { return !(lhs == rhs); }
template <typename T, typename U> bool operator!=(U lhs, const Modular<T>& rhs) { return !(lhs == rhs); }
template <typename T> bool operator<(const Modular<T>& lhs, const Modular<T>& rhs) { return lhs.value < rhs.value; }
template <typename T> Modular<T> operator+(const Modular<T>& lhs, const Modular<T>& rhs) { return Modular<T>(lhs) += rhs; }
template <typename T, typename U> Modular<T> operator+(const Modular<T>& lhs, U rhs) { return Modular<T>(lhs) += rhs; }
template <typename T, typename U> Modular<T> operator+(U lhs, const Modular<T>& rhs) { return Modular<T>(lhs) += rhs; }
template <typename T> Modular<T> operator-(const Modular<T>& lhs, const Modular<T>& rhs) { return Modular<T>(lhs) -= rhs; }
template <typename T, typename U> Modular<T> operator-(const Modular<T>& lhs, U rhs) { return Modular<T>(lhs) -= rhs; }
template <typename T, typename U> Modular<T> operator-(U lhs, const Modular<T>& rhs) { return Modular<T>(lhs) -= rhs; }
template <typename T> Modular<T> operator*(const Modular<T>& lhs, const Modular<T>& rhs) { return Modular<T>(lhs) *= rhs; }
template <typename T, typename U> Modular<T> operator*(const Modular<T>& lhs, U rhs) { return Modular<T>(lhs) *= rhs; }
template <typename T, typename U> Modular<T> operator*(U lhs, const Modular<T>& rhs) { return Modular<T>(lhs) *= rhs; }
template <typename T> Modular<T> operator/(const Modular<T>& lhs, const Modular<T>& rhs) { return Modular<T>(lhs) /= rhs; }
template <typename T, typename U> Modular<T> operator/(const Modular<T>& lhs, U rhs) { return Modular<T>(lhs) /= rhs; }
template <typename T, typename U> Modular<T> operator/(U lhs, const Modular<T>& rhs) { return Modular<T>(lhs) /= rhs; }
template<typename T, typename U>
Modular<T> power(const Modular<T>& a, const U& b) {
assert(b >= 0);
Modular<T> x = a, res = 1;
U p = b;
while (p > 0) {
if (p & 1) res *= x;
x *= x;
p >>= 1;
}
return res;
}
template <typename T>
std::ostream& operator<<(std::ostream& stream, const Modular<T>& number) {
return stream << number();
}
template <typename T>
std::istream& operator>>(std::istream& stream, Modular<T>& number) {
typename common_type<typename Modular<T>::Type, int64_t>::type x;
stream >> x;
number.value = Modular<T>::normalize(x);
return stream;
}
/*
using ModType = int;
struct VarMod { static ModType value; };
ModType VarMod::value;
ModType& md = VarMod::value;
using Mint = Modular<VarMod>;
*/
constexpr int mod = 1e9 + 7;
using Mint = Modular<std::integral_constant<decay<decltype(mod)>::type, mod>>;
}
}
using namespace Math;
/************************************ math/modint.hpp end ************************************/
//#define BRUH_WHY_TESTCASES
//#define PREC 7
//#define USACO "sleepy"
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
auto DIST = uniform_int_distribution<ll>(0, INFL);
ll grnd()
{
return DIST(rng);
}
const int maxn = 1e5 + 5;
const int maxk = 2e2 + 5;
int opt[maxk][maxn];
struct Line {
ll m; ll b;
Line () : m(0), b(-INFL) {}
Line(ll _m, ll _b) : m(_m), b(_b) {};
ll operator() (ll x) const {
return m*x + b;
}
};
struct lichao {
int tl; int tr; int tm; Line v; int l; int r; int mine;
lichao() {}
lichao(ll _tl, ll _tr) {
tl=_tl; tr=_tr; tm = tl + (tr-tl)/2; l=r=-1; mine = -1;
}
};
lichao* mem;
int mem_nxt = 0;
pair<ll, int> query(int me, ll x) {
pair<ll, int> mres = {mem[me].v(x), mem[me].mine};
if(mem[me].tl != mem[me].tr) {
if(x <= mem[me].tm) {
if(mem[me].l != -1) {
pair<ll, int> other = query(mem[me].l, x);
if(other.fi > mres.fi) {
mres = other;
}
}
} else {
if(mem[me].r != -1) {
pair<ll, int> other = query(mem[me].r, x);
if(other.fi > mres.fi) {
mres = other;
}
}
}
}
return mres;
}
void update(int me, Line u, int who) {
if(u(mem[me].tm) > mem[me].v(mem[me].tm)) {
swap(u, mem[me].v);
swap(who, mem[me].mine);
}
if(u(mem[me].tl) > mem[me].v(mem[me].tl)) {
if(mem[me].l == -1) {
mem[me].l = mem_nxt; mem_nxt++;
mem[mem[me].l] = lichao(mem[me].tl, mem[me].tm);
}
update(mem[me].l, u, who);
} else if(u(mem[me].tr) > mem[me].v(mem[me].tr)) {
if(mem[me].r == -1) {
mem[me].r = mem_nxt; mem_nxt++;
mem[mem[me].r] = lichao(mem[me].tm+1, mem[me].tr);
}
update(mem[me].r, u, who);
}
}
ll odp[maxn];
ll ndp[maxn]; ll pre[maxn];
ll a[maxn]; int n; int k;
void solve() {
cin >> n >> k;
mem = (lichao*)malloc(sizeof(lichao) * n * 8);
rep(i, n) {
cin >> a[i];
}
pre[0] = a[0];
for(int i = 1; i < n; ++i) {
pre[i] = a[i] + pre[i-1];
}
for(int i = 2; i <= k+1; ++i) {
mem_nxt = 1;
mem[0] = lichao(0, 1e9 + 5);
for(int j = i-1; j < n; ++j) {
update(0, Line(pre[j-1], odp[j-1] - pre[j-1] * pre[j-1]), j-1);
pair<ll, int> res = query(0, pre[j]);
assert(res.se != -1);
opt[i][j] = res.se;
ndp[j] = res.fi;
}
rep(i, n) {
odp[i] = ndp[i];
}
}
cout << odp[n-1] << '\n';
vector<int> seq;
int pos = n-1;
for(int i = k+1; i >= 2; --i) {
pos = opt[i][pos];
seq.pb(pos+1);
}
reverse(all(seq));
for(auto e : seq) {
cout << e << ' ';
}
cout << '\n';
}
signed main()
{
#ifdef USACO
freopen(USACO ".in", "r", stdin);
freopen(USACO ".out", "w", stdout);
#endif
GOGOGO
#ifdef PREC
cout << fixed << setprecision(PREC);
#endif
int t=1;
#ifdef BRUH_WHY_TESTCASES
cin >> t;
#endif
while(t--)
{
solve();
}
BYEBYE
}
/* PLEASE READ THIS
* N = 1
* GUESS A!!!!!!!
* DO SOMETHING INSTEAD OF NOTHING
*/
