1033. To Fill or Not to Fill (25)

#define  _CRT_SECURE_NO_WARNINGS 
#include<string>
#include<string.h>
#include<vector>
#include<map>
#include<stack>
#include<iostream> 
#include<algorithm>
#include<stdio.h> 
using namespace std;
struct Station
{
float price;
int dis;
Station()
{
price = 0; dis = 0;
}
};
bool cmp(Station a,Station b)
{
return a.dis < b.dis;
}
int main()
{
int Cmax, D, Davg, N;
scanf("%d %d %d %d",&Cmax,&D,&Davg,&N);

Station *sta = new Station[N];
for (int i = 0; i < N; i++)
scanf("%f %d",&sta[i].price,&sta[i].dis);
sort(sta,sta+N,cmp);
int max = N;
for (int i = 0; i < max; i++)
if (sta[i].dis > D)
N--;
if (N == 0 || sta[0].dis!=0)
{
cout << "The maximum travel distance = 0.00\n";
return 0;
}
float X = 0,price=0;//目前X行走的距离
float cap = 0;// cap目前汽油量
for (int i = 0; i < N && X < D;)
{
//如果能到达终点
if ((D - X) <= cap*Davg )
{
price += ((float)(D - X) / (float)Davg - cap)*sta[i].price;
printf("%.2f\n",price);
return 0;
}
//如果不能到达终点，查看能否到达下一个加油站
if (cap*Davg + X < sta[i].dis)//汽车无法到达下一个汽油站
{
printf("The maximum travel distance = %.2f\n", cap*Davg + X);
return 0;
}
else
{ 
cap -= (sta[i].dis - X) / (float)Davg;
X = sta[i].dis;

//如果这是最后一个加油站
if (i == N - 1)
{
if ((D - X) > Cmax*Davg)//无法到达终点
{
printf("The maximum travel distance = %.2f\n", Cmax*Davg + X);
return 0;
}
else
{
price += ((float)(D - X) / (float)Davg - cap)*sta[i].price;
printf("%.2f\n",price);
return 0;
}
}
//如果不是最后一个加油站 
bool find = false;
int imark = 0; 
//查找能到达范围内价格比当前小的加油站 
for (int j = i + 1; j < N && sta[j].dis<=X+Cmax*Davg ; j++)
{
if (sta[j].price < sta[i].price)
{
find=true; imark = j;
break;
}
}
if (find)
{
float cost = (float)(sta[imark].dis - X) / (float)Davg;
if (cost > cap)//加油
{
price += (cost - cap)*sta[i].price;
cap = cost;
}
i = imark;
}
else//当前价格最小
{
if (D - X > Cmax*Davg)//加油
{
price += (Cmax - cap)*sta[i].price;
cap = Cmax;
}
else
{
price += ((float)(D - X) / (float)Davg - cap)*sta[i].price;
printf("%.2f\n", price);
return 0;
}
i++;
}

}
}
return 0;
}