hdu 2191 悼念512汶川大地震遇难同胞——珍惜现在，感恩生活

完全背包

#include <iostream>#include <algorithm>#include <cstdio>#include <cstring>using namespace std;#define N 110int main (){    int p[N], h[N], c[N], dp[N], t, n, m;    cin >> t;    while (t--)    {        memset (dp, 0, sizeof(dp));        cin >> n >> m;        for (int i=1; i<=m; i++)            cin >> p[i] >> h[i] >> c[i];        for (int i=1; i<=m; i++)            for (int k=1; k<=c[i]; k++)                for (int j=n; j>=p[i]; j--)                    dp[j] = max (dp[j], dp[j-p[i]] + h[i]);        cout << dp[n] << endl;    }    return 0;}