hdu--1114--完全背包

cf分要高涨了。。。

这题 就是个裸体啊 只要读懂题意 现在还是喜欢多做些英文的题目...

　　　　touch  me

做这题的时候 突然发现 自己对V的遍历顺序为什么在完全背包是顺序 和在01背包是逆序懂了好多....

#include <iostream>
#include <algorithm>
using namespace std;

const int inf = 0x3f3f3f3f;
const int size = 10010;
const int num = 520;
int dp[size];
int value[num];
int weight[num];

int main()
{
    cin.sync_with_stdio(false);
    int t , n , m , p;
    while( cin >> t )
    {
        while( t-- )
        {
            cin >> n >> m;
            n = m-n;
            cin >> p;
            fill( dp , dp+size , -inf );
            dp[0] = 0;
            for( int i = 0 ; i<p ; i++ )
            {
                cin >> value[i] >> weight[i];
            }
            for( int i = 0 ; i<p ; i++ )
            {
                for( int j = weight[i] ; j<=n ; j++ )
                {
                       if(dp[j]<0) 
                       dp[j] = dp[ j-weight[i] ] + value[i];  
                    else  
                    {  
                        if( dp[ j-weight[i] ] + value[i] > 0 ) 
                            dp[j] = min( dp[j] , dp[ j-weight[i] ] + value[i] );  
                    }  
                }
            }
            if( dp[n]<0 )
            {
                cout << "This is impossible." << endl;
            }
            else
            {
                cout << "The minimum amount of money in the piggy-bank is " << dp[n] <<"." << endl;
            }
        }
    }
    return 0;
}


#include <iostream>
#include <algorithm>
using namespace std;

const int inf = 0x3f3f3f3f;
const int size = 10010;
const int num = 520;
int dp[size];
int value[num];
int weight[num];

int main()
{
    cin.sync_with_stdio(false);
    int t , n , m , p;
    while( cin >> t )
    {
        while( t-- )
        {
            cin >> n >> m;
            n = m-n;
            cin >> p;
            fill( dp , dp+size , inf );
            dp[0] = 0;
            for( int i = 0 ; i<p ; i++ )
            {
                cin >> value[i] >> weight[i];
            }
            for( int i = 0 ; i<p ; i++ )
            {
                for( int j = weight[i] ; j<=n ; j++ )
                {
                    dp[j] = min( dp[j] , dp[j-weight[i]]+value[i] );
                }
            }
            if( dp[n]==inf )
            {
                cout << "This is impossible." << endl;
            }
            else
            {
                cout << "The minimum amount of money in the piggy-bank is " << dp[n] <<"." << endl;
            }
        }
    }
    return 0;
}

初始化为-oo的是别人写的  觉得蛮不一样的 因为我写了个初始化+oo的

today:

　　孤单是一个人的狂欢

　　狂欢是一群人的孤单