PAT-A1033-To Fill or Not to Fill

PAT 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.

输入描述

 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: Pi, the unit gas price, and D
i(≤D), the distance between this station and Hangzhou, for i=1,⋯,N. All the numbers in a line are separated by a space.

输出描述

 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.

---

示例：

输入

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

输出

749.17

输入

50 1300 12 2
7.10 0
7.00 600

输出

The maximum travel distance = 1200.00

---

解题思路

 对我来说属于偏难的一道贪心题目了，对于这题一共有n个站点，首先是读入数据，之后按照里七点的距离远近对结构体进行排序，在最后一个数据后面添加一个加油费用为0，距离为终点距离的节点（伪加油站）。需要说明的是如果排完序后第一个节点的距离不是0，说明我车已经没有油了，但是起点离我是有距离的，直接打印出距离是0就可以了；如果距离是0，就可以开始进行遍历了，初始值灵花费为0，油箱初始的值是0，每次从加油站出发移动的最大的距离就是油箱加满的值乘以单位距离花费的油箱。之后开始寻找下一个移动的油站，从当前油站的下一个油站开始遍历，不断更新后面站点油价的最小值，如果出现后面的一个油价是小于当前油价的就退出，这个油站就是我们要前往的下一站点，如果遍历条件都不符合，输出当前的距离加上油箱加满后的行驶最大距离；后面对前往下一个站点做准备，如果是油价小于当前的站点的值的话 就加能到该站点的油就好，如果大于，就直接加满油，最后如果走到最后一个节点就输出一共耗费多少钱就好了，如果不是就输出最大移动的距离=当前站点的距离加上油箱加满后移动的最大值。

参考代码

#include <cstdio>
#include <algorithm>

using namespace std;
const int maxn = 510;
const int INF = 0x3f3f3f3f; //定义最大值 用来寻找“最小值”

struct station {
    double price, dis;
} st[maxn];

bool cmp(struct station a, struct 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; //最后一个终点添加
    st[n].dis = D;
    sort(st, st + n, cmp); //注意这里的排序 是n
    if (st[0].dis != 0) { //第一个节点的值是非0的情况 就结束了
        printf("The maximum travel distance = 0.00\n");
    } else {
        int now = 0;
        double ans = 0, nowTank = 0, MAX = Cmax * Davg;
        while (now < n) { //在每个节点前都要进行一次寻找
            int k = -1;
            double priceMin = INF;
            for (int i = now + 1; i <= n && st[i].dis - st[now].dis <= MAX; ++i) { //开始寻找符合条件的下一个油站
                if (st[i].price < priceMin) {
                    priceMin = st[i].price;
                    k = i;
                    if (priceMin < st[now].price) { //出现小于当前值的要退出
                        break;
                    }
                }
            }
            if (k == -1) break;
            double need = (st[k].dis - st[now].dis) / Davg;
            if (priceMin < st[now].price) { //最小值小于当前值
                if (nowTank < need) {
                    ans += (need - nowTank) * st[now].price;
                    nowTank = 0;
                } else {
                    nowTank -= need;
                }
            } else {//最小值大于当前值
                ans += (Cmax - nowTank) * st[now].price;
                nowTank = Cmax - need;
            }
            now = k;
        }
        if (now == n) {
            printf("%.2f\n", ans);
        }else{
            printf("The maximum travel distance = %.2f\n",st[now].dis + MAX);
        }
    }

}