To Fill or Not to Fill PAT/九度OJ 分析

题目描述：

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.

输入：

For each case, the first line contains 4 positive numbers: Cmax (<= 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 Di (<=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
50 1300 12 2
7.10 0
7.00 600

样例输出：

749.17
The maximum travel distance = 1200.00

来源：

2012年浙江大学计算机及软件工程研究生机试真题

最近在准备保研机试，结果遇到了一个曾经算法课上做过的题，无奈水平太渣，重做一遍又花了我将近三小时，大佬们请问我这水平能保到哪些学校呢？

这道题目主要考察贪心算法。提示一点：可能起点没有加油站。

下面是代码：

//To fill or not to fill

    
    

     
     #include<stdio.h>
#include<algorithm>
using namespace std;
    
    
    
    

     
     struct sta {
 float price;
 float loc;
 bool operator<(const sta &A)const
 {
  return loc < A.loc ? 1 : 0;
 }
}buf[501];
    
    
    
    

     
     int main()
{
 int n, i, j;
 float davg,rest,d,cmax;
 while (scanf("%f%f%f%d", &cmax, &d, &davg, &n) != EOF)
 {
  for (i = 0; i < n; i++)
  {
   scanf("%f%f", &buf[i].price, &buf[i].loc);
  }
  sort(buf, buf + n);
  if (buf[0].loc != 0)
  {
   printf("The maximum travel distance = 0.00\n");
   continue;
  }
  buf[n].loc = d;//注意这里将终点也看成加油站
  buf[n].price = 0;
  float cost = 0,rest=0,maxdis=0;
  //cost是最终花费，rest是油箱剩余油量，maxdis是能走的最远距离
  for (i = 0; i < n; )
  {
   float min = 10000,allmin = 10000; 
   //min是下一个比本加油站便宜的加油站，minj是加油站编号，
   //allmin是在本加油站加满油可行驶范围内最便宜的加油站，allj也是加油站编号
   int allj = 0, minj = 0,tag=0;
   //PS：不要骂我，代码风格太渣，定义变量乱七八糟，被舍友骂好几次了
   if (buf[i + 1].loc > buf[i].loc + cmax*davg)
   {//如果无法到达下一个加油站的话
    maxdis = buf[i].loc + cmax*davg;
    printf("The maximum travel distance = %.2f\n", maxdis);
    cost = -111;
    break;
   }
   //如果可以到达下一个加油站：
   for (j = i+1; (buf[j].loc <= buf[i].loc + cmax*davg)&&j<=n; j++)
   {
    if (buf[i].price >= buf[j].price&&tag==0)
    {//求离本加油站最近的便宜的加油站
     min = buf[j].price;
     minj = j;
     tag = 1;
    }
    else
    {//求在本加油站加满油可行驶范围内最便宜的加油站
     if (allmin >= buf[j].price)
     {
      allmin = buf[j].price;
      allj = j;
     }
    }
   }
   if (tag == 1)
   {//如果存在 离本加油站最近的便宜的加油站是下一个加油站
    if ((buf[minj].loc - buf[i].loc) / davg - rest > 0)
    {
     cost += buf[i].price*((buf[minj].loc - buf[i].loc)*1.0 / davg - rest);
     rest = 0;
    }
    else
    {
     cost += 0;
     rest = rest - (buf[minj].loc - buf[i].loc)*1.0 / davg;
    }
    i = minj;
   }
   else//否则，下一个加油的地方为可达范围内最便宜的加油站
   {
     cost += buf[i].price*(cmax - rest);//本加油站需要的花费
     rest = cmax - (buf[allj].loc - buf[i].loc)*1.0 / davg;//到达下一加油站后剩余油量  
     i = allj;
   }
  }
  if(cost!=-111)
   //如果可以到达终点：
   printf("%.2f\n", cost);
 }
 return 0;
}