原题地址:http://www.patest.cn/contests/pat-a-practise/1033
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: 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.
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
解题思路:有意思的一道题。我的想法是将每一单位距离的单价记录在数组中,把每一个汽油占加满油能覆盖的区域内的单价更新为原记录和该汽油站价格的最小值。(不知道这算什么算法?请知道的朋友告知)
代码如下:
#include <stdio.h>
#include <cstring>
#define MAXD 30005
#define INF 100000
double site[MAXD];
int Cm,D,Da,N;
int main(){
freopen("1033.txt","r",stdin);
scanf("%d%d%d%d",&Cm,&D, &Da, &N);
int T = Cm * Da;
for(int i = 0; i < D; i++) site[i] = INF;
for(int i = 0; i < N; i++){
double p;
int s;
scanf("%lf %d",&p, &s);
// printf("%f-%d\n",p,s);
for(int j = s ; j < D && j-s < T; j++){
if(site[j]-p > 0.001) site[j] = p;
// printf("site[%d] : %.2f ",j,site[j]);
}
}
double cost = 0;
for(int i = 0; i < D; i++){
if(site[i] - INF > -0.001){
printf("The maximum travel distance = %.2f\n",(double)i);
return 0;
}
cost += site[i];
// printf("cost:%.2f == site[%d]:%.2f\n",cost,i,site[i]);
}
printf("%.2f",cost/Da);
return 0;
}