PAT-A-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; D​avg​​ (≤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 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.

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

---

一个很巧妙的思路，按照贪心算法，为了达到路费最少，总是尽可能保障在油费最少的地方加满油，否者邮箱里的右刚好到下一站。

使用flag数组来标志路程是否可达，初始化0表示都不可达，假如到了某一加油站加了油之后，从该站到杭州的距离开始到汽车能跑的距离置为1；由于是贪心算法，即总是先满足油费最低的加油站，给结构体按照油费递增排序。然后按照上述思路开始给flag赋值。

遍历输出的时候，如果某一位置flag为0，即无论加油，该位置不可达return掉 

#include <iostream>
#include <vector>
#include <string>
#include <stack>
#include <queue>
using namespace std;
struct station{               //保存加油站信息
	double price;
	int distance;
}sta[501];
bool cmp(const station s1,const station s2){
	return s1.price<s2.price;
}
int main(){
	int cap,dis,cost,num;
	int flag[30001]={0};         //！！！判断是否可达
	double sum=0;
	scanf("%d %d %d %d",&cap,&dis,&cost,&num);
	for(int i=0;i<num;i++){
		scanf("%lf %d",&sta[i].price,&sta[i].distance);
	}
	sort(sta,sta+num,cmp);
	int max,cnt;
	for(int  j=0;j<num;j++){      //总是尽可能多加油，能加一箱肯定加一箱，用不了一箱，用多少 
                                  //加多少
		if(cap*cost+sta[j].distance>dis) max=dis-sta[j].distance;
		else max=cap*cost;
		cnt=0;
		for(int index=sta[j].distance;index<max+sta[j].distance;index++){
			if(flag[index]==0){
				flag[index]=1;
				cnt++;
			}
		}
		sum+=cnt/(cost*1.0)*sta[j].price;           //这一步很关键,cnt加出来的结果是里程
	}                                               //需要除以油耗
	for(int k=0;k<dis;k++){
		if(flag[k]==0){
			printf("The maximum travel distance = %.2lf\n", (double)k);
			return 0;
		}
	}
	printf("%.2lf\n",sum);
	return 0;
}