POJ 2624 Charm Bracelet DP（背包問題）

題意：Bessie去珠寶點裡買鐲子，現在有n只鐲子，每隻有有一個權重w,一個吸引力d。Bessie最多能擁有的權重為weight。求Bessie所能買得鐲子的總吸引力的最大值。

#include<iostream>#include<cstdlib>using namespace std;int dp[12881], w[3403], v[3403];int main(){int number,weight,i,j,temp;cin >> number >> weight;for ( i = 0; i < number; i++ )cin >> w[i] >> v[i];memset ( dp, 0, sizeof (dp) );for ( i = 0; i < number; i++ ){for ( j = weight; j >= w[i]; j-- ){temp = dp[j-w[i]] + v[i];if ( temp > dp[j] )dp[j] = temp;}}cout << dp[weight] << endl;return 0;}