洛谷 P1504 积木城堡

题目传送门

解题思路:

01背包.

AC代码:

#include<iostream>
#include<cstdio>
#include<vector>

using namespace std;

int n,sum[101],id,_min = 1999999999;
vector<int> a[101];
bool f[101][10001];

int main() {
    scanf("%d",&n);
    for(int i = 1;i <= n; i++) {
        while(true) {
            int u;
            scanf("%d",&u);
            if(u == -1) break;
            a[i].push_back(u);
            sum[i] += u;
        }
        if(_min > sum[i]) {
            _min = sum[i];
            id = i;
        }
        f[i][0] = 1;
    }
    for(int i = 1;i <= n; i++)
        for(int j = 0;j < a[i].size(); j++)
            for(int k = sum[i];k >= a[i][j]; k--)
                f[i][k] = f[i][k] | f[i][k - a[i][j]]; 
    _min++;
    while(_min--) {
        bool flag = 1;
        for(int j = 1;j <= n; j++) 
            if(!f[j][_min])
                flag = 0;
        if(flag) {
            printf("%d",_min);
            return 0;
        }
    }
    printf("0");
    return 0;
}