动态规划-龟兔赛跑

Select Code

#include<iostream>
using namespace std;
int main()
{
	int n, vr, vt1, vt2, L, c, t;
	while (cin >> L)
	{
		int p[101] = { 0 };
		cin >> n >> c >> t >> vr >> vt1 >> vt2;
		for (int i = 0; i < n; i++)
		{
			cin >> p[i];
		}
		p[n] = L;
		double T[101] = { 0 };
		if (p[0] < c) T[0] = 1.0*p[0] / vt1;
		else T[0] = 1.0*c / vt1 + 1.0*(p[0] - c) / vt2;
		for (int i = 1; i <= n; i++)
		{
			if (p[i] < c) T[i] = 1.0*p[i] / vt1;
			else T[i] = 1.0*c / vt1 + 1.0*(p[i] - c) / vt2;
			for (int j = 0; j < i; j++)
			{
				double t2;
				if (p[i] - p[j] < c) t2 = 1.0*(p[i] - p[j]) / vt1;
				else t2 = 1.0*c / vt1 + 1.0*(p[i] - p[j] - c) / vt2;
				if (T[j] + t2 + t < T[i])T[i] = T[j] + t2 + t;
			}
		}
		if (T[n] < 1.0*L / vr) cout << "What a pity rabbit!"; 
		else cout << "Good job,rabbit!";
		cout << endl;
	}
	return 0;
}