hdu ()

完全背包问题

参考网址：http://baike.baidu.com/view/1946917.html

#include<iostream>#include<stdio.h>#include<string.h>#include<algorithm>#include<cmath>using namespace std;int dp[10010];int a[]={150,200,350};int main(){    int n,t,i,j;    scanf("%d",&n);    while(n--)    {        memset(dp,0,sizeof(dp));        scanf("%d",&t);        for(i=0;i<3;i++)        {            for(j=a[i];j<=t;j++)              dp[j]=max(dp[j],dp[j-a[i]]+a[i]);        }        printf("%d\n",t-dp[t]);    }}