码迷,mamicode.com
首页 >  
搜索关键字:cargo    ( 117个结果
POJ1789:Truck History(Prim算法)
http://poj.org/problem?id=1789DescriptionAdvanced Cargo Movement, Ltd. uses trucks of different types. Some trucks are used for vegetable delivery, ot...
分类:其他好文   时间:2014-09-12 23:28:14    阅读次数:232
Loading Cargo
Loading Cargo"Look Stephen, here's a list of the items that need to be loaded onto the ship. We're going to need a lot of batteries." Nikola handed hi...
分类:其他好文   时间:2014-08-25 18:53:24    阅读次数:230
hdu2962 Trucking (最短路+二分查找)
Problem DescriptionA certain local trucking company would like to transport some goods on a cargo truck from one place to another. It is desirable to ...
分类:其他好文   时间:2014-08-21 17:03:24    阅读次数:246
POJ1787Charlie's Change
Charlie's Change Time Limit: 1000MS   Memory Limit: 30000K Total Submissions: 2978   Accepted: 844 Description Charlie is a driver of Advanced Cargo Movement, Ltd. Charlie ...
分类:其他好文   时间:2014-08-09 11:48:57    阅读次数:358
POJ 2263 Heavy Cargo(二分+并查集)
题目地址:POJ 2263 这题是在网上的一篇关于优先队列的博文中看到的。。但是实在没看出跟优先队列有什么关系。。我用的二分+并查集做出来了。。。 二分路的载重量。然后用并查集检查是否连通。 代码如下: #include #include #include #include #include #include #include #include #include using...
分类:其他好文   时间:2014-08-02 20:56:54    阅读次数:262
POJ2263&ZOJ1952--Heavy Cargo【Floyd】多源最短路变形
链接:http://poj.org/problem?id=2263 题意:有n个点,m条路,每条路双向的,现在卡车从某点到另一点,卡车的承载无上限,但是马路的承载有上限,问卡车应该承载多少才不会压坏马路。 poj2253和它类似,链接:http://poj.org/problem?id=2253 解题报告:Here 就是在两点之间找一条路径,使路径中权值最小的那条边的权值最...
分类:其他好文   时间:2014-08-01 16:02:41    阅读次数:294
POJ 1789 Truck History
Truck HistoryTime Limit: 2000MSMemory Limit: 65536KTotal Submissions: 18093Accepted: 6989DescriptionAdvanced Cargo Movement, Ltd. uses trucks of diff....
分类:其他好文   时间:2014-07-31 16:52:56    阅读次数:350
POJ 1789:Truck History(prim&&最小生成树)
Truck History Time Limit: 2000MS   Memory Limit: 65536K Total Submissions: 17610   Accepted: 6786 Description Advanced Cargo Movement, Ltd. uses trucks of different typ...
分类:其他好文   时间:2014-07-22 22:49:33    阅读次数:209
poj 1789 Truck History 最小生成树
Description Advanced Cargo Movement, Ltd. uses trucks of different types. Some trucks are used for vegetable delivery, other for furniture, or for bricks. The company has its own code describing each...
分类:其他好文   时间:2014-07-21 22:38:48    阅读次数:286
Poj 2263 Heavy Cargo Floyd 求最大容量路
f[i][j] = max(f[i][j],min(f[i][k],f[j][k]))#include #include #include #include #include #include #include #include #include #include #include #include...
分类:其他好文   时间:2014-07-20 22:31:27    阅读次数:243
117条   上一页 1 ... 9 10 11 12 下一页
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!