dp[i]表示的是,到达第i个加电站所用时间;
思路就是枚举到第i个加电站的最近的一次加电;
求出dp[i]的最优解;
dp[i]=min(dp[j]+time,dp[i]) j<i; time是j到i的时间
然后思路就很清晰了
<pre name="code" class="cpp">#include<cstdio>
#include<cstring>
#include<iostream>
using namespace std;
double dp[150],num[150];
int main()
{
int i,j,n;
double v1,v2,v3,c,l,t;
while(scanf("%lf",&l)!=EOF)
{
scanf("%d %lf %lf %lf %lf %lf",&n,&c,&t,&v1,&v2,&v3);
for(i=1;i<=n+1;i++)//到达哪个加电站,n+1为终点
{
if(i<=n) scanf("%lf",&num[i]);
else num[i]=l;
if(num[i]>c) dp[i]=c/v2+(num[i]-c)/v3;
else dp[i]=num[i]/v2;
for(j=1;j<i;j++)//此加油站加油,这个加油站为到i之前最后一个加油的
{
double time;
if(num[i]-num[j]>c) time=c/v2+(num[i]-num[j]-c)/v3+t;
else time=(num[i]-num[j])/v2+t;
dp[i]=min(dp[i],dp[j]+time);
}
//printf("dp[%d]=%lf v1=%lf\n",i,dp[i],l/v1);
}
if(l/v1<dp[n+1]) printf("Good job,rabbit!\n");
else printf("What a pity rabbit!\n");
}
return 0;
}