#include#include#includeusing namespace std;const int MAXV=510;const int INF=0x3fffffff;int N,M,S,D; //城市数，高速公路数，起点，终点bool visit[MAXV]; //标记...
分类：
其他好文 时间：
2015-03-09 20:38:33
阅读次数：
170
http://acm.hdu.edu.cn/showproblem.php?pid=4612
Problem Description
N planets are connected by M bidirectional channels that allow instant transportation. It's always possible to travel b...
分类：
其他好文 时间：
2015-03-03 18:41:28
阅读次数：
143
There are N gas stations along a circular route, where the amount of gas at station i is gas[i].
You have a car with an unlimited gas tank and it costs cost[i] of gas to travel from station i to it...
分类：
其他好文 时间：
2015-02-27 17:07:10
阅读次数：
147
ZOJ Problem Set - 2913Bus PassTime Limit: 5 Seconds Memory Limit: 32768 KBYou travel a lot by bus and the costs of all the seperate tickets are sta...
分类：
其他好文 时间：
2015-02-26 22:56:31
阅读次数：
217
旅行家的预算（Travel）【问题描述】一个旅行家想驾驶汽车以最少的费用从一个城市到另一个城市（假设出发时油箱是空的）。给定两个城市之间的距离D1、汽车油箱的容量C（以升为单位）．每升汽油能行驶的距离D2、出发点每升汽油价格P和沿途油站数N（N可以为零），油站i离出发点的距离Di、每升汽油价格Pi（...
分类：
其他好文 时间：
2015-02-26 14:45:29
阅读次数：
277
时间限制400 ms内存限制65536 kB代码长度限制16000 B判题程序Standard作者CHEN, YueA traveler's map gives the distances between cities along the highways, together with the co...
分类：
其他好文 时间：
2015-02-14 16:12:22
阅读次数：
154
There are N gas stations along a circular route, where the amount of gas at station i is gas[i].
You have a car with an unlimited gas tank and it costs cost[i] of gas to travel from station i to
...
分类：
其他好文 时间：
2015-02-06 15:06:34
阅读次数：
180
