蓝书DP,贪心的线性dp
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
//typedef __int128 LL;
//typedef unsigned long long ull;
#define F first
#define S second
typedef long double ld;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef pair<ld,ld> pdd;
const ld PI=acos(-1);
const ld eps=1e-9;
//unordered_map<int,int>mp;
#define ls (o<<1)
#define rs (o<<1|1)
#define pb push_back
const int seed=131;
const int M = 5000+7;
int f[32][M];
pii g[M];
struct node
{
int x,y;
}pre[32][M];
int n,m,sz,ct;
int pr[M];
void dfs(int x,int y)
{
// cout<<x<<" "<<y<<endl;
if(x==0)return ;
if(pre[x][y].x==x)
for(int i=1;i<=x;i++)
pr[g[i].S]++;
else
for(int i=pre[x][y].x+1;i<=x;i++)
pr[g[i].S]++;
dfs(pre[x][y].x,pre[x][y].y);
}
int p[M];
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);
cin>>n>>m;
sz=n;
for(int i=1;i<=n;i++)
cin>>g[i].F,g[i].S=i;
sort(g+1,g+1+n,greater<pii>());
memset(f,127,sizeof(f));
for(int i=1;i<=n;i++)g[i].F+=g[i-1].F;
f[0][0]=0;
for(int i=1;i<=n;i++)
for(int j=i;j<=m;j++)
{
if(f[i][j]>f[i][j-i])
f[i][j]=f[i][j-i],pre[i][j]=(node){i,j-i};
for(int k=1;k<=i;k++)
{
int w=f[i-k][j-k]+(i-k)*(g[i].F-g[i-k].F);
if(f[i][j]>w)
f[i][j]=w,pre[i][j]=(node){i-k,j-k};
}
// cout<<i<<" "<<j<<" "<<f[i][j]<<endl;
}
dfs(n,m);
cout<<f[n][m]<<endl;
for(int i=1;i<=n;i++)
cout<<pr[i]<<" ";
return 0;
}