Hdu 2602(动态规划入门)

Bone Collector

最近开始整理动态规划，希望对自己有所帮助。
01背包模板题

Problem description

Many years ago , in Teddy’s hometown there was a man who was called “Bone Collector”. This man like to collect varies of bones , such as dog’s , cow’s , also he went to the grave …
The bone collector had a big bag with a volume of V ,and along his trip of collecting there are a lot of bones , obviously , different bone has different value and different volume, now given the each bone’s value along his trip , can you calculate out the maximum of the total value the bone collector can get ?

input

1
5 10
1 2 3 4 5
5 4 3 2 1

output

14

#include <iostream>
#include<map>
#include<stdio.h>
#include<algorithm>
#include<math.h>
#include<string.h>
#define ll long long
using namespace std;
const int N=1005;
struct node{
    ll mon,wei;
}a[N];
ll dp[N];
int main()
{
  int t;scanf("%d",&t);
  while(t--){
    memset(dp,0,sizeof(dp));
    int n,m;
    scanf("%d%d",&n,&m);
    for(int i=0;i<n;i++)scanf("%lld",&a[i].wei)；
    for(int i=0;i<n;i++)scanf("%lld",&a[i].mon);
    for(int i=0;i<n;i++){
            for(int j=m;j>=a[i].mon;j--){
                    dp[j]=max(dp[j],dp[j-a[i].mon]+a[i].wei);
            }
    }
    printf("%d\n",dp[m]);
  }
}