hdu 多重背包（不需装满） 的模板题

#include <cstdio>
#include <algorithm>
#include <iostream>
#include <cstring>
#define MAX 107

using namespace std;

int w[MAX];
int c[MAX];
int v[MAX];

int dp[MAX];

int main  ( )
{
    int t,n,m;
    scanf ( "%d" , &t );
    while ( t-- )
    {
        scanf ( "%d%d" , &n ,&m );
        for ( int i = 1 ; i <= m ; i++ ) scanf ( "%d%d%d" , &c[i] ,  &w[i] , &v[i] );
        memset ( dp , 0 , sizeof ( dp ) );
        for ( int i = 1 ; i <= m ; i++ )
        {
            if ( c[i]*v[i] >= n )
            {
                for ( int j = c[i] ; j <= n ; j++ )
                    dp[j] = max ( dp[j] , dp[j-c[i]] + w[i] );
                continue;
            }
            int k = 1;
            while ( k < v[i] )
            {
                for ( int j = n ; j >= k*c[i] ; j-- )
                    dp[j] = max ( dp[j] , dp[j-k*c[i]] + k*w[i] );
                v[i] -= k;
                k <<= 1;
            }
            for ( int j = n ; j >= v[i]*c[i] ; j-- )
                dp[j] = max ( dp[j] , dp[j-v[i]*c[i]] + v[i]*w[i] );
        }
        printf ( "%d\n" , dp[n] );
    }
}