hdu 1203 I NEED A OFFER! dp

0-1背包

dp[i]=max(dp[i],1-(1-dp[i-a])*(1-b));

dp[j]表示当选择一所学校，用 i 这么多钱的时候他可以收到至少一份offer的最大概率

View Code

#include <stdio.h>
#include <string.h>

float max(float a,float b)
{
return a>b?a:b;
}

int main()
{
int n,m,i,j,a;
float b,dp[10005];
while (scanf("%d%d",&n,&m)!=EOF)
    {
if(n==0&&m==0)break;
        memset(dp,0,sizeof(dp));
for (i=0;i<m;i++)
        {
            scanf("%d%f",&a,&b);
for (j=n;j>=a;j--)
            {
                dp[j]=max(dp[j],1-(1-dp[j-a])*(1-b));
            }
        }
        printf("%.1f%%\n",dp[n]*100);
    }
return 0;
}

转载于:https://www.cnblogs.com/104-gogo/archive/2011/11/10/2244067.html