HDU 2602 Bone collector 01背包

裸的01背包，不解释

Bone Collector

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 21261    Accepted Submission(s): 8530

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

The first line contain a integer T , the number of cases.
Followed by T cases , each case three lines , the first line contain two integer N , V, (N <= 1000 , V <= 1000 )representing the number of bones and the volume of his bag. And the second line contain N integers representing the value of each bone. The third line contain N integers representing the volume of each bone.

 

Output

One integer per line representing the maximum of the total value (this number will be less than 2³¹).

Sample Input

  
  

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

Sample Output

  
  

   
   14
  
  

直接粘的是寒假写的代码，代码风格很烂

Run ID	Submit Time	Judge Status	Pro.ID	Exe.Time	Exe.Memory	Code Len.	Language	Author
8761152	2013-07-30 09:45:16	Accepted	2602	31MS	292K	658 B	C++	算法·成诚

#include<stdio.h>
#include<stdlib.h>
#include<string.h>
int f[1020],w[1020],c[1020];

int find_max(int x,int y)
{
	if (x>=y)return x;
	else return y;
}
int main()
{
	int t,n,v,i,p,j;
	scanf("%d",&t);
	for ( p = 0; p < t; p++)
	{
		scanf("%d%d",&n,&v);
		memset(f,0,sizeof(f));
		memset(w,0,sizeof(w));
		memset(c,0,sizeof(c));
		for ( i = 1; i <= n; i++)
		{
			scanf("%d",&w[i]);
		}
		for ( i = 1; i <= n; i++)
		{
			scanf("%d",&c[i]);
		}
		for ( i = 1; i <= n; i++)
		{
			for ( j = v; j >=c[i]	; j--)
			{
				f[j]=find_max(f[j] , f[j-c[i]]+w[i]);
			}
		}
		printf("%d\n",f[v]);
	}
	system("pause");
	return 0;
}