hdu4508 湫湫系列故事——减肥记I(完全背包模板)

#include<iostream>#include<cstdio>#include<cmath>#include<algorithm>#include<memory.h>#include<map>#include<queue>#include <deque>#include <list>#include <ctime>#include <stack>#include <vector>#include<set>#define Maxn 100050typedef long long ll;#define rep(i,j,n) for(int i=j;i<=n;i++)#define per(i,j,k) for(int i=j;i>=k;--i)#define lowbit(a) a&-a#define Max(a,b) a>b?a:b#define Min(a,b) a>b?b:aconst int inf = 0x3f3f3f3f;const double pi = acos(-1.0);using namespace std;int dp[Maxn],n,m;int v[105],w[105];int main(){   while(~scanf("%d",&n))    {   rep(i,1,n) scanf("%d%d",&v[i],&w[i]);        scanf("%d",&m);         memset(dp,0,sizeof(dp));        rep(i,1,n) rep(j,w[i],m) dp[j]=Max(dp[j],dp[j-w[i]]+v[i]);        printf("%d\n",dp[m]);    }    return 0;}