浙大PAT 1033

分析：贪心算法；

从起点选择 最近的比起点小的；如果没有选择范围内最小的；其次看距离终点是否在范围内；

过程：调试了很多次，最后只是两个浮点数的问题；

下面是ac 代码；

#include 
#include 
#include 
#include 
using namespace std;
struct zhandian{
	double gas;
	float dis;
}sta[501];
int  n;
int  carry,maxd;
int  dvag;
bool cmp(const zhandian &a,const zhandian &b)
{
	return a.dis>sta[i].gas;
		cin>>sta[i].dis;
	}
	sort(sta,sta+n,cmp);
	maxlength=carry*dvag;
	int i=0;
	float length=0;
	float count=0;
	int flag=0;
	int chushi=0;
	float youxiang=0;
	if(sta[0].dis!=0)
	{
		printf("The maximum travel distance = 0.00\n");continue;
	}
		while(1)
	{
		int kk=maxd-sta[chushi].dis;		
		if(kk<=maxlength)
		{
			int k=findmin(chushi,maxlength);
			if(k==-1)
	    		 {	
					length=maxd;
					count+=(kk-youxiang*dvag)*sta[chushi].gas/dvag;break;
				 }
				else
			 {
						float kount=sta[k].dis-sta[chushi].dis-youxiang*dvag;
						if(kount>=0)
						{
						count+=kount*sta[chushi].gas/dvag;
						youxiang=0;}
						else {
							youxiang=-kount/dvag;
						}
				length+=sta[k].dis-sta[chushi].dis; 
				chushi=k;
	    	 }	
		}
		else 
		{
			int k=findmin(chushi,maxlength);
			if(k==-1)
			{
				length+=maxlength;flag=1;break;
			}
			else{
				if(sta[k].gas<=sta[chushi].gas)
				{
					float kount=sta[k].dis-sta[chushi].dis-youxiang*dvag;
					if(kount>=0)
					{
						count+=kount*sta[chushi].gas/dvag;
						youxiang=0;}
						else {
							youxiang=-1.0*kount/dvag;
						}
				}
				else {
					count+=(carry-youxiang)*sta[chushi].gas;
					youxiang=carry-(sta[k].dis-sta[chushi].dis)/dvag;
				}
				length+=sta[k].dis-sta[chushi].dis; 
				chushi=k;
			}
		}
		
	}
	if(flag==0) printf("%.2f\n",count);
	else printf("The maximum travel distance = %.2f\n",length);
}
	return 0;
}