他说少年如歌

find the safest road TimeLimit: 10000/5000 MS (Java/Others)    Memory Limit:32768/32768 K (Java/Others) Total Submission(s): 10675    Accepted Submission(s): 3778 Problem Description XX 星球有很多城

三国志 时间限制：3000 ms  |  内存限制：65535 KB 难度：5 描述 《三国志》是一款很经典的经营策略类游戏。我们的小白同学是这款游戏的忠实玩家。现在他把游戏简化一下，地图上只有他一方势力，现在他只有一个城池，而他周边有一些无人占的空城，但是这些空城中有很多不同数量的同种财宝。我们的小白同学虎视眈眈的看着这些城池中的财宝。 按照游戏的规则，他只要指派一名

粗略讲讲SPFA算法的原理，SPFA算法是1994年西安交通大学段凡丁提出 是一种求单源最短路的算法 算法中需要用到的主要变量 int n;  //表示n个点，从1到n标号 int s,t;  //s为源点，t为终点 int d[N];  //d[i]表示源点s到点i的最短路 int p[N];  //记录路径（或者说记录前驱） queue q;  //一个队列，用STL实现，当然

天下第一 时间限制：1000 ms  |  内存限制：65535 KB 难度：3 描述 AC_Grazy一直对江湖羡慕不已,向往着大碗吃肉大碗喝酒的豪情，但是“人在江湖漂,怎能   不挨刀",”人在江湖身不由己",如果自己的武功太差,在江湖会死的很惨，但是AC_Grazy没有   武功秘籍练不了绝世武功.有道是“山重水复疑无路,柳暗花明又一村”,在AC_Grazy

Problem Description Einbahnstra e (German for a one-way street) is a street on which vehicles should only move in one direction. One reason for having one-way streets is to facilitate a smoother flow

Problem Description Jimmy experiences a lot of stress at work these days, especially since his accident made working difficult. To relax after a hard day, he likes to walk home. To make things even n

Travel TimeLimit: 10000/2000 MS (Java/Others)    Memory Limit:32768/32768 K (Java/Others) Total Submission(s): 2580    Accepted Submission(s): 845 Problem Description       Oneday, Tom travele

Problem Description 给你n个点，m条无向边，每条边都有长度d和花费p，给你起点s终点t，要求输出起点到终点的最短距离及其花费，如果最短距离有多条路线，则输出花费最少的。 Input 输入n,m，点的编号是1~n,然后是m行，每行4个数 a,b,d,p，表示a和b之间有一条边，且其长度为d，花费为p。最后一行是两个数 s,t;起点s，终点。n和m为0时输入结束。

Einbahnstrasse TimeLimit: 2000/1000 MS (Java/Others)    Memory Limit:32768/32768 K (Java/Others) Total Submission(s): 3079    Accepted Submission(s): 960 Problem Description Einbahnstra e(Germ

Arbitrage TimeLimit: 2000/1000 MS (Java/Others)    Memory Limit:65536/32768 K (Java/Others) Total Submission(s): 6518    Accepted Submission(s): 3015 Problem Description Arbitrage is the use o

HDU Today TimeLimit: 15000/5000 MS (Java/Others)    Memory Limit:32768/32768 K (Java/Others) Total Submission(s): 23336    Accepted Submission(s): 5597 Problem Description 经过锦囊相助，海东集团终于度过了危机，从

A strange lift TimeLimit: 2000/1000 MS (Java/Others)    Memory Limit:65536/32768 K (Java/Others) Total Submission(s): 19482    Accepted Submission(s): 7214 Problem Description There is a stran

Choose the best route TimeLimit: 2000/1000 MS (Java/Others)    Memory Limit:32768/32768 K (Java/Others) Total Submission(s): 12423    Accepted Submission(s): 4039 Problem Description One day ,

Invitation Cards Time Limit: 8000MS Memory Limit: 262144K Total Submissions: 24003 Accepted: 7918 Description In the age of television, not manypeople

Cow Contest 时间限制：1000 ms  |  内存限制：65535 KB 难度：4 描述 N (1 ≤ N ≤ 100) cows, conveniently numbered 1..N, are participating in a programming contest. As we all know, some cows code better than