#include <cstdio> #include <algorithm> using namespace std; typedef long long lint; int n,k; lint dp[100005][205],a[100005]; int track[100005][205]; int main(){ int t; scanf("%d %d",&n,&k); for (int i=0; i<n; i++) { scanf("%d",&t); a[i+1] = a[i] + t; } for (int i=n; i>=1; i--) { for (int j=k; j>=1; j--) { lint res = 0; for (int k=i+1; k<=n; k++) { lint piv = dp[k][j-1] + (a[k-1]-a[i-1])*(a[n]-a[k-1]); if(res < piv){ res = piv; track[i][j] = k; } } dp[i][j] = res; } } printf("%lld\n",dp[1][k]); int pos1 = 1, pos2 = k; for (int i=0; i<k; i++) { printf("%d ",track[pos1][pos2]-1); pos1 = track[pos1][pos2]; pos2--; } }