HDU2191 重复背包

#include <iostream>
#include <cstring>
#include <cstdio>
#include <string>
#include <algorithm> 
using namespace std;
const int maxn=105;
int dp[maxn];
int val[maxn];
int w[maxn];
int num[maxn];
int V;		
void Zeoronepack(int cost,int weight)
{
	int i,j;
	for(i=V;i>=cost;i--)
		dp[i]=max(dp[i],dp[i-cost]+weight); 
}

void Completepack(int cost,int weight)
{
	int i,j;
	for(i=cost;i<=V;i++)
		dp[i]=max(dp[i],dp[i-cost]+weight);
}

void Multiple(int cost,int weight,int acount)
{
	int i,j;
	if(acount*cost>=V){
		Completepack(cost,weight);
		return;
	}
	int k=1;
	while(k<acount)
	{
		Zeoronepack(k*cost,k*weight);
		acount-=k;
		k*=2;	
	}	
	Zeoronepack(acount*cost,acount*weight);
}		
		
int main()
{		
	int i,j,k;
	int T;
	cin >> T;
	while(T--)
	{	
		int n,m;
		cin >> n >> m;
		memset(dp,0,sizeof(dp));
		V=n;
		for(i=1;i<=m;i++){
			scanf("%d %d %d",&w[i],&val[i],&num[i]);
			Multiple(w[i],val[i],num[i]);
		} 
		cout << dp[V] << endl;
	}	
	return 0;
}