PKU 3639 Exchange Rates

典型的dp

0<=i<=n-1

dp[i+1].usa=max{int(dp[j].can/r[i]*0.97)} 0<=j<=i;

dp[i+1].can=max{int(dp[j].usa*r[i]*0.97)} 0<=j<=i;

很简单的DP题

不过题目很邪恶,精度问题要注意-_____________-是说每次取到0.01..不能疏忽

1. #include <iostream>
2. #include <vector>
3. using namespace std;
4. struct _m
5. {double usa,can;}M;
6. vector<_m> dp;
7. vector<double> r;
8. int main()
9. {
10.     int i,j,n;
11.     double tmp;
12.     M.usa=M.can=0;
13.     while(cin>>n,n)
14.         {
15.             dp.resize(n+1,M);
16.             r.clear();
17.             while(n--) cin>>tmp,r.push_back(tmp);
18.             dp[0].can=100000;dp[0].usa=int(100000/r[0]*0.97);
19.             for(i=0;i<r.size();i++)
20.                 {
21.                     dp[i+1]=dp[i];
22.                     for(j=0;j<=i;j++)
23.                     {
24.                      if(int(dp[j].usa*r[i]*0.97)>dp[i+1].can)
25.                         dp[i+1].can=int(dp[j].usa*r[i]*0.97);
26.                      if(int(dp[j].can/r[i]*0.97)>dp[i+1].usa)
27.                         dp[i+1].usa=int(dp[j].can/r[i]*0.97);
28.                     }               
29.                 }
30.             printf("%.2lf/n",dp[r.size()].can/100);
31.         }
32.     return 0;
33. }