|Vijos|动态规划|P1059 积木城堡

https://vijos.org/p/1059

求出最小城堡高度作为背包容量，对每个城堡进行01背包，然后判断即可

(很久没写背包题目居然错了个细节调了半天...)

#include<cstdio>
#include<algorithm>
#include<cstring>
#include<queue>
#include<cstdlib>
#define ms(i,j) memset(i,j,sizeof(i));
using namespace std;
const int maxn = 100 + 5;
int n;
int f[maxn][10005];
int a[maxn][maxn];
int main()
{
	int t = 100000000;
	scanf("%d", &n);
	for (int i=1;i<=n;i++)
	{
		int tot = 0;
		int j = 0;
		int ai;
		scanf("%d", &ai);
		while (ai!=-1)
		{
			a[i][++j] = ai;
			tot += ai; 
			scanf("%d", &ai);
		}
		a[i][0] = j;
		t = min(t, tot);
	}
	ms(f,0);
	for (int i=1;i<=n;i++)
	{
		for (int j=1;j<=a[i][0];j++)
		for (int k=t;k>=a[i][j];k--)
		{
			f[i][k] = max(f[i][k], f[i][k-a[i][j]]+a[i][j]);
		}
	}
	int ans = 0;
	for (int i=t;i>0;i--)
	{
		bool flag = true;
		for (int j=1;j<=n;j++)
		{
			if (f[j][i]!=i) flag = false;
		}
		if (flag)
		{
			ans = i;
			break;
		}
	}
	printf("%d\n", ans);
    return 0;
}