HOJ13907 Diana and the Golden Apples

標籤：max   噁心   amp   bsp   ret   txt   using   put   and   

簡單背包題，寫上是因為這個板子還不錯，本校OJ有個噁心的地方，單kas輸入的時候寫成多kas會wa~~

#include<cstdio>#include<cstring>#include<iostream>#include<algorithm>#include<queue>using namespace std;const int maxn=3e4+10;const int N=1e3+10;typedef long long LL;int wei[N],val[N],dp[maxn];int main(){    freopen("input.txt","r",stdin);    int l,td,th,n,d;    scanf("%d%d%d%d%d",&l,&td,&th,&n,&d);    memset(dp,0,sizeof dp);    if(td>=th){printf("Diana marries Humperdonkey\n");return 0;}    int w,x;    for(int i=0;i<n;i++)    {        scanf("%d%d",&w,&x);        wei[i]=(l-x)*w*d;        val[i]=w;    }    int m=(th-td)*l-1;    for(int i=0; i<n; i++)    {        for(int j=m; j>=wei[i]; j--)            dp[j] = max(dp[j],dp[j-wei[i]]+val[i]);    }    printf("%d\n",dp[m]);    return 0;}

 

HOJ13907 Diana and the Golden Apples