1033 To Fill or Not to Fill(加不加油)

								1033 To Fill or Not to Fill

With highways available, driving a car from Hangzhou to any other city is easy. But since the tank capacity of a car is limited, we have to find gas stations on the way from time to time. Different gas station may give different price. You are asked to carefully design the cheapest route to go.

Input Specification:
Each input file contains one test case. For each case, the first line contains 4 positive numbers: C
​max
​​ (≤ 100), the maximum capacity of the tank; D (≤30000), the distance between Hangzhou and the destination city; Davg (≤20), the average distance per unit gas that the car can run; and N (≤ 500), the total number of gas stations. Then N lines follow, each contains a pair of non-negative numbers: P​i
​​ , the unit gas price, and Di(≤D), the distance between this station and Hangzhou, for i=1,⋯,N. All the numbers in a line are separated by a space.

Output Specification:
For each test case, print the cheapest price in a line, accurate up to 2 decimal places. It is assumed that the tank is empty at the beginning. If it is impossible to reach the destination, print The maximum travel distance = X where X is the maximum possible distance the car can run, accurate up to 2 decimal places.

Sample Input 1:

50 1300 12 8
6.00 1250
7.00 600
7.00 150
7.10 0
7.20 200
7.50 400
7.30 1000
6.85 300

Sample Output 1:

749.17

Sample Input 2:

50 1300 12 2
7.10 0
7.00 600

Sample Output 2:

The maximum travel distance = 1200.00	

题意：
一辆车，其油箱的最大容积为Cmax,某人要开这辆车从A前往B，A与B之间的距离为D ，单位汽油能够行进Dvag，在A与B的路上有N个加油站，各加油站在不同的位置，其油价可能不相同。在A时油箱油量为0，如果能从A到B，求最小的花费；若不能，则计算出最大行驶距离。

思路：贪心算法
1、首先将各加油站按照距离进行排序，如果没有距离为0的加油站，则直接输出The maximum travel distance = 0.00
2、如果在能到达的最大范围内，有加油站的油价比当前的油价低，那肯定加到能够恰好到这个油价比当前低的加油站距离的油量
3.如果在最大的范围内没有加油站油价比当前低，那就加满
4、可以将目的地也看做加油站，其距离设置为相应距离，油钱为0，这样其油钱一定比所有的加油站油钱都要低，在最后一定会选择目的地作为下一到达加油站。
核心思想：在油价低的加油站尽量多加点油

#include <cstdio>
#include <algorithm>
using namespace std;
const int maxn = 510;
const int INF = 1000000;
struct station
{
    double price, dis;  //油价、离终点的距离
}st[maxn];

bool cmp(station a, station b)
{
    return a.dis < b.dis;
}


int main()
{
    int n;
    double Cmax, D, Davg;
    scanf("%lf%lf%lf%d", &Cmax, &D, &Davg, &n);
    for(int i = 0; i < n; i++)
    {
        scanf("%lf%lf", &st[i].price, &st[i].dis);
    }
    st[n].price = 0;    //数组最后面放置终点，价格为0
    st[n].dis = D;      //终点距离为D
    sort(st, st + n, cmp);  //按距离从小到大排序
    if(st[0].dis != 0)  //如果第一个加油站距离不是0，无法前进
        printf("The maximum travel distance = 0.00\n");
    else
    {
        int now = 0;    //当前所处加油站的编号
        double ans = 0, nowTank = 0, MAXdistance = Cmax * Davg;     //花费、当前油量和满油行驶距离
        while(now < n)  //每次循环找出下一个需要到达的加油站
        {
            int k = -1;     //最低油价的加油站的编号
            double priceMin = INF;  //最低油价
            for(int i = now + 1; i <= n && st[i].dis - st[now].dis <= MAXdistance; i++)
            {
                if(st[i].price < priceMin)  //油价比当前最低油价低
                {
                    priceMin = st[i].price;     //更新最低油价
                    k = i;          //记录低油价的编号
                    if(priceMin < st[now].price)    //如果找到第一个油价低于当前油价的加油站，直接中断循环
                        break;
                }
            }
            if(k == -1) break;  //满油状态下无法找到加油站，退出循环输出结果
            
            //下面为能找到可到达的加油站k，计算转移花费
            double need = (st[k].dis - st[now].dis) / Davg;     //从now到k需要的油量
            if(priceMin < st[now].price)    //加油站k的油价低于当前油价
            {
                //刚好买能够到达k的油量
                if(nowTank < need)      //如果当前油量不足need
                {
                    ans += (need - nowTank) * st[now].price;    //补足need
                    nowTank = 0;    //到达加油站k后油量为0
                }
                else
                    nowTank -= need;    //如果当前油量超过need，直接到达加油站k，不需要计算花费(没加油)
            }
            else    //加油站k的油价高于当前油价
            {
                ans += (Cmax - nowTank) * st[now].price;    //将油箱加满
                nowTank = Cmax - need;  //到达加油站k后油量为Cmax - need
            }
            now = k;    //到达加油站k，进入一层循环
        }
        if(now == n)    //能到达终点
            printf("%.2f\n", ans);
        else            //不能到达终点
            printf("The maximum travel distance = %.2f\n", st[now].dis + MAXdistance);
    }
    return 0;
}