题目连接http://poj.org/problem?id=1789Truck HistoryDescriptionAdvanced Cargo Movement, Ltd. uses trucks of different types. Some trucks are used for veget...
分类:
其他好文 时间:
2015-08-31 17:15:15
阅读次数:
175
链接:http://poj.org/problem?id=1789代码:#include #include #include #include #include #include using namespace std;const int N = 2005;const int INF = 0xfff...
分类:
其他好文 时间:
2015-08-16 22:44:57
阅读次数:
129
最小生成树,主要是题目比较难懂。#include #include #include #include using namespace std;const int Maxn=2000+10;const int maxn=2000*2000+10;int Father[Maxn];struct Edg...
分类:
其他好文 时间:
2015-08-13 11:18:08
阅读次数:
149
Truck History
Time Limit : 4000/2000ms (Java/Other) Memory Limit : 131072/65536K (Java/Other)
Total Submission(s) : 123 Accepted Submission(s) : 36
Problem Description
Advanced Cargo Movement...
分类:
其他好文 时间:
2015-08-13 10:07:57
阅读次数:
143
Truck HistoryDescriptionAdvanced Cargo Movement, Ltd. uses trucks of different types. Some trucks are used for vegetable delivery, other for furniture...
分类:
其他好文 时间:
2015-08-12 21:36:25
阅读次数:
137
Truck HistoryTime
Limit: 2000MS Memory Limit: 65536KTotal Submissions: 21660 Accepted: 8419DescriptionAdvanced Cargo Movement, Ltd. uses trucks of different types. Some trucks are used for vegetable...
分类:
其他好文 时间:
2015-08-12 17:00:03
阅读次数:
135
Truck HistoryTime Limit : 4000/2000ms (Java/Other)Memory Limit : 131072/65536K (Java/Other)Total Submission(s) : 59Accepted Submission(s) : 21Problem ...
分类:
其他好文 时间:
2015-08-11 23:04:22
阅读次数:
104
Truck HistoryTime Limit:2000MSMemory Limit:65536KTotal Submissions:21534Accepted:8379DescriptionAdvanced Cargo Movement, Ltd. uses trucks of different...
分类:
其他好文 时间:
2015-08-11 21:12:54
阅读次数:
178
Truck HistoryTime Limit: 2000MSMemory Limit: 65536KTotal Submissions: 21535Accepted: 8380DescriptionAdvanced Cargo Movement, Ltd. uses trucks of diffe...
分类:
其他好文 时间:
2015-08-11 21:03:13
阅读次数:
110
主题链接:http://poj.org/problem?id=1789思维:一个一个点,每两行之间不懂得字符个数就看做是权值。然后用kruskal算法计算出最小生成树我写了两个代码一个是用优先队列写的。可是超时啦,不知道为什么。希望有人能够解答。后面用的数组sort排序然后才AC。code:数组so...
分类:
编程语言 时间:
2015-07-26 14:07:00
阅读次数:
135