[acm]HDOJ 2059 龟兔赛跑

题目地址：

http://acm.hdu.edu.cn/showproblem.php?pid=2059

起点和终点，共n+2个点，n+2个状态，简单DP即可。

---

 //11512698    2014-08-21 17:11:55    Accepted    2059
 //62MS    368K    969 B    G++    空信高手
 //起点和终点，共n+2个点，n+2个状态，简单DP即可
 #include<iostream>
 #include<cstdio>
 using namespace std;
 const int MAX=;
 const double INF=0xfffff;
 double DP[MAX];
 int s[MAX];
 using namespace std;
 double min(double t1,double t2)
 {
     return (t1<t2)?t1:t2;
 }
 int main()
 {
     freopen("input.txt","r",stdin);
     int L;
     int N,C,T;
     int VR,VT1,VT2;
     double Time;
     while(cin>>L)
     {
         cin>>N>>C>>T>>VR>>VT1>>VT2;
         for(int i=;i<=N;i++)
             cin>>s[i];
         s[N+]=L;
         s[]=;
         DP[]=;
         for(int i=;i<=N+;i++)
         {
             DP[i] = INF;
             for(int j=;j<i;j++)
             {
                 int dis=s[i]-s[j];
                 if(dis>C) Time=((double)C)/VT1+((double)(dis-C))/VT2;
                 else Time=((double)dis)/VT1;
                 Time+=DP[j];
                 if(j>)
                     Time += T;
                 DP[i]=min(DP[i],Time);
             }
         }
         if(DP[N+]<((double)L/VR))
             cout<<"What a pity rabbit!"<<endl;
         else
             cout<<"Good job,rabbit!"<<endl;
     }
     return ;
 }