
弗洛伊德
文章平均质量分 81
xiaoleiacm
asdfghjkl;
展开
-
poj 2263 Heavy Cargo
Heavy Cargo Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 2555 Accepted: 1405 Description Big Johnsson Trucks Inc. is a company specialized in manufacturin原创 2012-11-19 17:03:21 · 691 阅读 · 0 评论 -
1008 最短路
Arbitrage Time Limit : 2000/1000ms (Java/Other) Memory Limit : 65536/32768K (Java/Other) Total Submission(s) : 7 Accepted Submission(s) : 5 Pro原创 2013-01-27 09:52:38 · 492 阅读 · 0 评论 -
1018 最短路
find the safest road Time Limit : 10000/5000ms (Java/Other) Memory Limit : 32768/32768K (Java/Other) Total Submission(s) : 18 Accepted Submis原创 2013-01-27 10:13:07 · 419 阅读 · 0 评论 -
1006 最短路
Minimum Transport Cost Time Limit : 2000/1000ms (Java/Other) Memory Limit : 65536/32768K (Java/Other) Total Submission(s) : 22 Accepted Submission(s) : 8 Problem Description These are N cities in原创 2013-01-26 21:05:21 · 492 阅读 · 0 评论 -
1010_1020 最短路
Einbahnstrasse Time Limit : 2000/1000ms (Java/Other) Memory Limit : 32768/32768K (Java/Other) Total Submission(s) : 19 Accepted Submission(s原创 2013-01-27 10:07:55 · 444 阅读 · 0 评论 -
图论的一些事儿 模版
最小生成树(求的就是给定一个无向图,挑选若干条边,连成一个树行图(无圈),使得所选边的权至和最小。) Prim: //prim算法 int prim(int n) { int i,j,min,pos; int sum=0; memset(isvisited,false,sizeof(isvisited)); //初始化 for (i原创 2012-11-10 16:56:29 · 755 阅读 · 0 评论 -
poj 3259 Wormholes
Wormholes Time Limit: 2000MS Memory Limit: 65536K Total Submissions: 21769 Accepted: 7748 Description While exploring his many farms, Farmer John has discovered a num原创 2012-11-20 20:20:30 · 441 阅读 · 0 评论 -
poj 1797 Heavy Transportation
Heavy Transportation Time Limit: 3000MS Memory Limit: 30000K Total Submissions: 16299 Accepted: 4263 Description Background Hugo Heavy is happy. After the breakdown o原创 2012-11-19 16:51:31 · 504 阅读 · 0 评论