这个题目,我只有一个问题,那就是为什么dp初始化的时候都必须为1???这代表一开始都必然不会录取?有谁能解释一下吗?
代码如下:百思不得其解。我把dp初始化为2,结果就全错了。
#include <iostream>
#include <iomanip>
#include<queue>
#include<math.h>
#include<algorithm>
#include<string.h>
#include<stdlib.h>
#include<stdio.h>
#include<iomanip>
#include<string.h>
#include<sstream>
#include<string>
#include<queue>
#define MAX 5842
//¶¨Ò庯Êý¶Î
#define repf(i,a,b) for(int i =(a);i<(b);i++)
#define repfe(i,a,b) for(int i =(a);i<=(b);i++)
using namespace std;
struct School{
public :
int cost;
double p ;
};
School schools[11111];
double dp[11111];
int main() {
int sum_money , school_num;
while(cin>>sum_money>>school_num)
{
if(sum_money==0&&school_num==0)
{
break ;
}
repfe(i ,1 , school_num)
{
cin>>schools[i].cost>>schools[i].p;
}
repf(i,0,11111)
{
dp[i]=1;
}
dp[0] = 1 ;
repfe(i,1,school_num)
{
for(int j = sum_money; j>= schools[i].cost; j--)
{
dp[j] = min(dp[j],dp[j-schools[i].cost]*(1-schools[i].p));
// cout << dp[j]<<endl;
}
}
printf("%.1lf%%\n",(1-dp[sum_money])*100);
// cout << 1-dp[sum_money] <<endl;
}
return 0 ;
}