Calm微笑

最短路Time Limit: 5000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 47106    Accepted Submission(s): 20779Problem Description在每年的校赛里，所有进入决赛的同学都会获得一件很

Dijkstra：适用于权值为非负的图的单源最短路径，用斐波那契堆的复杂度O(E+VlgV)BellmanFord：适用于权值有负值的图的单源最短路径，并且能够检测负圈，复杂度O(VE)SPFA：适用于权值有负值，且没有负圈的图的单源最短路径，论文中的复杂度O(kE)，k为每个节点进入Queue的次数，且k一般但此处的复杂度证明是有问题的，其实SPFA的最坏情况应该是O(VE).Flo

六度分离Time Limit: 5000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 7787    Accepted Submission(s): 3181Problem Description1967年，美国著名的社会学家斯坦利·米尔格兰姆提

find the safest roadTime Limit: 10000/5000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 11482    Accepted Submission(s): 4044Problem DescriptionXX星球有很多

一个人的旅行Time Limit: 1000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 27548    Accepted Submission(s): 9556Problem Description虽然草儿是个路痴（就是在杭电待了一年多，居然

SeasideTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1528    Accepted Submission(s): 1107Problem DescriptionXiaoY is living in

HDU TodayTime Limit: 15000/5000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 25216    Accepted Submission(s): 6093Problem Description经过锦囊相助，海东集团终于度

How Many Maos Does the Guanxi WorthTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 512000/512000 K (Java/Others)Total Submission(s): 1937    Accepted Submission(s): 744Problem Desc

B. Mike and Shortcutstime limit per test3 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputRecently, Mike was very busy with stu

D - 楼上和楼下都是水题.Time Limit:2000MS     Memory Limit:262144KB     64bit IO Format:%I64d & %I64uSubmit StatusDescriptionIn Absurdistan, there are n towns (numbered 1 through n) and m bidi

WormholesTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 39574 Accepted: 14541DescriptionWhile exploring his many farms, Farmer John has discovered a nu

Cow ContestTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 8968 Accepted: 5033DescriptionN (1 ≤ N ≤ 100) cows, conveniently numbered 1..N, are participa

畅通工程续Time Limit: 3000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 39898    Accepted Submission(s): 14745Problem Description某省自从实行了很多年的畅通工程计划后，终于修

Til the Cows Come HomeTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 39132 Accepted: 13307DescriptionBessie is out in the field and wants to get back t

Currency ExchangeTime Limit: 1000MS Memory Limit: 30000KTotal Submissions: 24432 Accepted: 8900DescriptionSeveral currency exchange points are working in our city

Silver Cow PartyTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 16654 Accepted: 7604DescriptionOne cow from each of N farms (1 ≤ N ≤ 1000) conveniently

FroggerTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 32931 Accepted: 10586DescriptionFreddy Frog is sitting on a stone in the middle of a lake. Sudden

Heavy TransportationTime Limit: 3000MS Memory Limit: 30000KTotal Submissions: 26747 Accepted: 7143DescriptionBackground Hugo Heavy is happy. After the breakdown

最短路Time Limit: 5000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 47986    Accepted Submission(s): 21137Problem Description在每年的校赛里，所有进入决赛的同学都会获得一件很

最短路径问题Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 19982    Accepted Submission(s): 5945Problem Description给你n个点，m条无向边，每条边都有长度d和花

find the mincost routeTime Limit: 1000/2000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 4206    Accepted Submission(s): 1693Problem Description杭州有