hdu 2059 龟兔赛跑

#include < iostream >
using   namespace  std;

struct  Node
{
    double time;
    double len;
} ;

int  main()
{
    int n;
    double L;
    double c,T;
    double vr,vt1,vt2;
    while(cin>>L)
    {
        cin>>n>>c>>T;
        cin>>vr>>vt1>>vt2;
        int i,j;
        double a[105];
        Node dp[105];
        for(i = 1;i <= n;i++)
            cin>>a[i];    
        double sum = L/vr;
        dp[0].time = 0.0;
        dp[0].len = c;
        a[0] = 0.0;
        a[n+1] = L;
        double dd;
        double t,t1,t2;
        double d,d1,d2;
        if(vt1<=vt2)
        {
            if( L/vt2 > sum)
            {
                cout<<"Good job,rabbit!"<<endl;
            }
            else
            {
                cout<<"What a pity rabbit!"<<endl;
            }
            continue;
        }
        for(i = 1;i <= n+1;i++)
        {
            if(a[i] <= c)
            {
                dp[i].time = a[i]/vt1;
                dp[i].len = c - a[i];
            }
            else
            {
                dp[i].time = c/vt1 + (a[i] - c)/vt2;
                dp[i].len = 0;
            }

            for(j = 1;j < i;j++)
            {
                dd = a[i] - a[j];
                if(dd <= dp[j].len)
                {
                    t = dd/vt1;
                    d = dp[j].len -dd;
                }
                else
                {
                    t1 = dp[j].len/vt1 + (dd-dp[j].len)/vt2 ;
                    d1 = 0;
                    if( c >= dd)
                    {
                        t2 = dd/vt1 + T;
                        d2 = c - dd ;
                    }
                    else
                    {
                        t2 =  c/vt1 + (dd - c)/vt2 +T;
                        d2 = 0;
                    }

                    if(t1 < t2)
                    {
                        t = t1 ;
                        d = d1;
                    }
                    else
                    {
                        t = t2;
                        d = d2;
                    }
                }
                if(dp[i].time > t + dp[j].time)
                {
                    dp[i].time = t + dp[j].time;
                    dp[i].len = d;
                }
            }//for(j = 1;j < i;j++)
        }
        if(dp[n+1].time > sum)
        {
            cout<<"Good job,rabbit!"<<endl;
        }
        else
        {
            cout<<"What a pity rabbit!"<<endl;
        }
    }
    return 0;
}