题目描写叙述:

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

分析:

贪心策略:如果如今自己处于A站,要考虑的是A站要不要加油,加多少油的问题。找到当前可达范围内(距离A站cmax*davg)下一个要加油的站B。

A站可达范围内, 分三种情况:

①没有加油站,------- 快到终点了,则加适量油到终点。或者 Impossible。则A站加满油到哪算哪;

②有更廉价的加油站 ------- 则找到第一家比A廉价的加油站B,加尽可能少的油(也可能油够直接开过去)到B站。

③仅仅有价格更高的加油站,------则当下A站加满油,寻找相对最廉价的加油站B 开过去。

对每个加油站进行贪心选择。

代码:

#include <iostream>
#include <stdio.h>
#include <algorithm>
#include <math.h>
#include <stdlib.h> using namespace std; struct gas_station{
float price;
int distance; bool operator < (const gas_station & A)const {
return distance < A.distance;
} }buff[501];
int main()
{
int Cmax,D,Davg,N;
int dis;
while(scanf("%d %d %d %d",&Cmax,&D,&Davg,&N)!=EOF){
for(int i = 0; i < N; i++){
scanf("%f %d",&buff[i].price,&buff[i].distance);
}
buff[N].distance = D;
buff[N].price = 100000000; sort(buff,buff+N); if(buff[0].distance > 0){
printf("The maximum travel distance = 0.00\n");
continue;
} dis = Cmax * Davg;//最大单次行车距离
float sum = 0;//总费用
float temp,remind_gas = 0;//剩余汽油量
int i ,k;
for(i = 0; i < N;i++){
k = i+1;
if(i != 0){
remind_gas -= (float)(buff[i].distance-buff[i-1].distance)/Davg;
}
//找到当前站之后第一个价格比它低的加油站
for(;k < N && buff[i].price <= buff[k].price;k++ )
continue;
if(buff[k].distance - buff[i].distance > dis){
sum += (Cmax-remind_gas)*buff[i].price;
remind_gas = Cmax;
}else{
temp = (float)(buff[k].distance-buff[i].distance)/Davg - remind_gas;
if(fabs(temp)>1e-5&&temp >0){
sum += temp*buff[i].price;
remind_gas = (float)(buff[k].distance-buff[i].distance)/Davg;
}
} if(buff[i+1].distance - buff[i].distance>dis){
double total_d = (double)(buff[i].distance + dis);
printf("The maximum travel distance = %.2f\n",total_d);
break;
}
}
if(i==N){
printf ("%.2f\n", sum);
} }
return 0;
}

注意:

比較浮点数是否大于零,须要加上fabs(temp),由于这个地方还wa了一次。

题目1437:To Fill or Not to Fill(贪心算法)的更多相关文章

  1. 九度oj 1437 To Fill or Not to Fill 2012年浙江大学计算机及软件工程研究生机试真题

    题目1437:To Fill or Not to Fill 时间限制:1 秒 内存限制:128 兆 特殊判题:否 提交:1488 解决:345 题目描述: With highways availabl ...

  2. 九度OJ 1437 To Fill or Not to Fill

    题目大意:小明从杭州去往某目的地,要经过一些加油站,每个加油站的价格不一样.若能顺利到达,求加油费用最少为多少,否则求出能行驶的最远距离. 思路:贪心算法 1>若下一加油站的价格更便宜,则只需走 ...

  3. 1033. To Fill or Not to Fill (25)

     题目链接:http://www.patest.cn/contests/pat-a-practise/1033 题目: 1033. To Fill or Not to Fill (25) 时间限制 1 ...

  4. 【贪心】PAT 1033. To Fill or Not to Fill (25)

    1033. To Fill or Not to Fill (25) 时间限制 10 ms 内存限制 32000 kB 代码长度限制 16000 B 判题程序 Standard 作者 ZHANG, Gu ...

  5. PAT 1033 To Fill or Not to Fill[dp]

    1033 To Fill or Not to Fill(25 分) With highways available, driving a car from Hangzhou to any other ...

  6. PAT 甲级 1033 To Fill or Not to Fill (25 分)(贪心,误以为动态规划,忽视了油量问题)*

    1033 To Fill or Not to Fill (25 分)   With highways available, driving a car from Hangzhou to any oth ...

  7. PAT_A1033#To Fill or Not to Fill

    Source: PAT A1033 To Fill or Not to Fill (25 分) Description: With highways available, driving a car ...

  8. PAT甲级——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 i ...

  9. PAT A1033 To Fill or Not to Fill (25 分)——贪心

    With highways available, driving a car from Hangzhou to any other city is easy. But since the tank c ...

  10. 1033 To Fill or Not to Fill

    PAT A 1033 To Fill or Not to Fill With highways available, driving a car from Hangzhou to any other ...

随机推荐

  1. HDU 2138

    这题用MILLER测试应该是不可避免的. #include <iostream> #include <cstdio> #include <stdlib.h> #in ...

  2. POJ 3613

    可以利用DP的思想来做,不过是在DP时加上了矩阵乘法的思想而已,但乘法不是真的乘法,而是mp[a][i]+mp[i][b]<mp[a][b]则更新,其实更像FLOYD. 但这是符合乘法的格式的. ...

  3. linux下使用convert命令修改图片分辨率【转】

    本文转载自:http://blog.csdn.net/mybelief321/article/details/9969949 Convert的resize子命令应该是在ImageMagick中使用较多 ...

  4. [jzoj 5661] 药香沁鼻 解题报告 (DP+dfs序)

    interlinkage: https://jzoj.net/senior/#contest/show/2703/0 description: solution: 注意到这本质就是一个背包,只是选了一 ...

  5. Spark Streaming概念学习系列之Spark Streaming的竞争对手

    不多说,直接上干货! Spark Streaming的竞争对手 Storm 在Storm中,先要设计一个用于实时计算的图状结构,我们称之为拓扑(topology).这个拓扑将会被提交给集群,由集群中的 ...

  6. 【转】如何使用windows的计划任务?计划任务?

    我们经常有一些程序想要过了几小时来运行:比如定时关机 或者说希望能够每天的几点执行一个什么程序: 这些所有的操作都需要用到windows的任务计划:或者叫计划任务:反正都一样 下面小编将指导大家创建一 ...

  7. vue中采用axios发送请求及拦截器

    这几天在使用vue中axios发送get请求的时候很顺手,但是在发送post请求的时候老是在成功的回调函数里边返回参数不存在,当时就纳闷了,经过查阅资料,终于得到了解决方案,在此做一总结: 首先我们在 ...

  8. eclipse搭建golang for windows

    用惯了eclipse,所以.... golang windows开发环境 参考文档:http://golang.org/doc/install 1.下载go安装包http://code.google. ...

  9. IPv6地址分配

  10. Java从入门到精通一步到位!

    Java作为近几年来非常火的编程语言,转行来做Java的人不计其数,但如今真正的人才仍然匮乏,所以学习Java一定要有一个系统的学习规划课程.阿里云大学帮您规划Java学习路线可以帮助您从一个小白成长 ...