[luogu] P2954 Grazing2 S DP

前言

题是好题 题解也是非常好的题解,所以在转载在这,如果侵权了必删 传送门 :

思路

CODE

const int N  = 1510;
int f[N][N];
int a[N];
int n,s;



void solve()
{		
	memset(f,0x3f,sizeof f);
	
	cin>>n>>s;
	
	
	for(int i=1;i>a[i];
	}
	int d =(int)((s-1)/(n-1));
	int c = s  - (n-1)*d;
	
	sort(a+1,a+1+n);
	f[1][1] = a[1] - 1;
	
	for(int i=2;i