Truck History
Time Limit: 2000MS
Memory Limit: 65536K
Total Submissions: 17606
Accepted: 6784
Description
Advanced Cargo Movement, Ltd. uses trucks of different types...
分类:
其他好文 时间:
2014-07-20 10:46:08
阅读次数:
181
最短路变形或最大生成树变形。
问 目标两地之间能通过的小重量。
用最短路把初始赋为INF,其他为0.然后找 dis[v]=min(dis[u], d);
生成树就是把最大生成树找出来,直到出发和终点能沟通的时候,最小的边就是。
Kruskal:
#include
#include
#include
#include
#include
#include
#include...
分类:
其他好文 时间:
2014-07-19 23:22:59
阅读次数:
236
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 ea...
分类:
其他好文 时间:
2014-07-18 23:10:11
阅读次数:
304
Truck HistoryTime Limit: 2000MSMemory Limit: 65536KTotal Submissions: 17271Accepted: 6621DescriptionAdvanced Cargo Movement, Ltd. uses trucks of diffe...
分类:
其他好文 时间:
2014-07-11 23:00:17
阅读次数:
212
Truck History
Time Limit: 2000MS
Memory Limit: 65536K
Total Submissions: 17275
Accepted: 6623
Description
Advanced Cargo Movement, Ltd. uses trucks of different typ...
分类:
其他好文 时间:
2014-07-10 23:51:01
阅读次数:
266
求给定起点到终点的路径中,最小边权的最大值
#include
#include
#include
#include
#include
#include
#include
#include
#include
#define inf 0x3f3f3f3f
#define ll __int64
#define mod 1000000007
using namespace st...
分类:
其他好文 时间:
2014-06-27 08:29:49
阅读次数:
251
链接:http://poj.org/problem?id=1789 或 http://acm.zju.edu.cn/onlinejudge/showProblem.do?problemId=1158
Description
Advanced Cargo Movement, Ltd. uses trucks of different types. Some trucks are use...
分类:
其他好文 时间:
2014-05-10 09:39:59
阅读次数:
440