动态规划：背包问题

 1 #include<stdio.h>
 2 #include<stdlib.h>
 3 #include<stdio.h>
 4 int dp[505][100005];
 5 int w[505],v[505];
 6 int max(int m,int n)
 7 {
 8     return m>n?m:n;
 9 }
10 void solve(int n,int m)
11 {
12     int i,j;
13     for(i=0;i<=m;i++)
14         dp[0][i]=0;
15     for(i=0; i<n; i++)
16         for(j=0; j<=m; j++)
17         {
18             if(j<w[i])
19                 dp[i+1][j]=dp[i][j];
20             else
21                 dp[i+1][j]=max(dp[i][j],dp[i][j-w[i]]+v[i]);
22         }
23         printf("%d",dp[n][m]);
24 }
25 int main()
26 {
27     int n,m,i;
28     scanf("%d%d",&n,&m);
29     for(i=0;i<n;i++)
30             scanf("%d%d",&w[i],&v[i]);
31     solve(n,m);
32     return 0;
33 } 

 1 #include <iostream>
 2 using namespace std;
 3 const int maxN = 501;
 4 const int maxM = 100001;
 5 int values[maxN][maxM];
 6 struct Prize
 7 {
 8     int need;
 9     int value;
10 }prizes[maxN];
11 
12 
13 void dp(int N, int M)
14 {
15     for (int i = 0; i <= M; i++)
16         if (i >= prizes[0].need)
17             values[0][i] = i / prizes[0].need * prizes[0].value;
18         else
19             values[0][i] = 0;
20     int max = 0;
21     for (int i = 1; i < N; i++)
22     {
23         for (int j = 0; j <= M; j++)
24         {
25             if (prizes[i].need > j)
26                 values[i][j] = values[i - 1][j];
27             else
28             {
29                 int tmp = values[i][j - prizes[i].need] + prizes[i].value;
30                 if (tmp > values[i - 1][j])
31                     values[i][j] = tmp;
32                 else
33                     values[i][j] = values[i - 1][j];
34             }
35         }
36     }
37 }
38 
39 int main()
40 {
41     int M, N;
42     cin >> N >> M;
43     for (int i = 0; i < N; i++)
44         cin >> prizes[i].need >> prizes[i].value;
45     prizes[N].need = prizes[N].value = 0;
46     
47     dp(N, M);    
48     cout << values[N - 1][M] << endl;
49     return 0;
50 }