(RQoj 15 采药------rwkj 10.1.5.253 1447) 递归 2

#include <iostream>
#include <string.h>
using namespace std;
int dp[105][1005], w[105],v[105],T,M,;
int max(int x,int y) { return x>y?x:y; }
int f(int x,int y)
{ int t;

if ( x==M+1 || y==0 ) return dp[x][y]=0;
else
{ t=f(x+1,y);
if ( y>=w[x] ) dp[x][y]=max(t,f(x+1,y-w[x])+v[x] ); else dp[x][y]=t;
}
return dp[x][y] ;
}
int main()
{ int i,j;
cin>>T>>M;
for ( i=1; i<=M; i++) cin>>w[i]>>v[i];

f(1,T);
cout<<dp[1][T]<<endl;
return 0;
}

 

 

 

转载于:https://www.cnblogs.com/2014acm/p/3908352.html