杭电2059

//动态规划思路
#include<stdio.h>
int a[150];
double dp[150]={0};
int main()
{
    double min(double x,double y);
    int len,n,maxlen,i,j,lenth;
    double time,vmax,vmin,vr,t;
    while(~scanf("%d%d%d%lf%lf%lf%lf",&len,&n,&maxlen,&time,&vr,&vmax,&vmin))
    {
        a[0]=0; a[n+1]=len;
        for(i=1; i<n+1; ++i)
            scanf("%d",&a[i]);
        for(i=1; i<=n+1; ++i)
        {
            dp[i]=len/vmin+1;//保证够大才能比较出最小值
            for(j=0; j<i; ++j)
            {
                lenth=a[i]-a[j];
                if(lenth>maxlen)
                    t=maxlen/vmax+(lenth-maxlen)/vmin;
                else
                    t=lenth/vmax;
                t+=dp[j];
                if(j)
                    t+=time;
                dp[i]=min(dp[i],t);//计算i之前j发电站到i的时间最小值
            }
        }
        if(dp[n+1]<len/vr)
            printf("What a pity rabbit!
");
        else
            printf("Good job,rabbit!
");
    }
}

double min(double x,double y)
{
    double z=x<y?x:y;
    return z;
}