完全背包 皇星客栈

http://acm.hdu.edu.cn/showproblem.php?pid=1114

#include<stdio.h>

int main( )
{
    int cases ;
    int f ;
    int e ;
    int maxVolumn ;
    int N ;
    int i ;
    int j ;
    int P[50001] ;
    int W[10001] ;
    int record[10001] ;
    const int INF = 1000000001 ;
    
    for( scanf("%d",&cases); cases>0 ; cases-- )
    {
        scanf( "%d %d",&e,&f);
        maxVolumn = f - e ;
        scanf("%d",&N); 
        for( i = 0 ; i < N ; i++ )
        {
            scanf( "%d %d",&P[i],&W[i] );
        }

        for( i = 0 ; i <= maxVolumn ; i++ )
            record[i] = INF ;

        record[0] = 0 ;
        
        for( i = 0 ; i < N ; i++ )
            for ( j = W[i] ; j <= maxVolumn ; j++ )
                if( record[j] > record[j-W[i]]+P[i] )
                    record[j] = record[j-W[i]]+P[i];

    
        
        if( record[maxVolumn] == INF )
            printf("This is impossible.\n");
        else
            printf("The minimum amount of money in the piggy-bank is %d.\n",record[maxVolumn]);
    }
    return 0;
}

// 这是ambition神牛的版本
// 初始化为-1

#include<stdio.h>
int num[10001],w[500],v[500];
main()
{
    int n,m,e,f,t,i,j;
    for(scanf("%d",&t);t>0;t--)
    {
        scanf("%d%d",&e,&f);
        m=f-e;
        for(scanf("%d",&n),i=0;i<n;i++)
            scanf("%d%d",&v[i],&w[i]);
        num[0]=0;
        for(i=1;i<=m;i++)
            num[i]=-1;

        for(i=0;i<n;i++)
        {
            for(j=w[i];j<=m;j++)
            {
                if(num[j-w[i]]!=-1&&num[j]!=-1)
                {if(num[j-w[i]]+v[i]<num[j]) num[j]=num[j-w[i]]+v[i];}
                else if(num[j-w[i]]!=-1&&num[j]==-1)
                {num[j]=num[j-w[i]]+v[i];}
            }
        }
        if(num[m]!=-1)
        printf("The minimum amount of money in the piggy-bank is %d.\n",num[m]);
        else
            printf("This is impossible.\n");
    }
    return 0;
}