摘要：Children’s QueueTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 8915Accepted Submission(s): 2835Problem DescriptionThere are many students in PHT School. One day, the headmaster whose name is PigHeader wanted all students stand in a line. He prescr 阅读全文

摘要：NightmareTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 5664Accepted Submission(s): 2819Problem DescriptionIgnatius had a nightmare last night. He found himself in a labyrinth with a time bomb on him. The labyrinth has an exit, Ignatius should get 阅读全文

摘要：Tempter of the BoneTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 54670Accepted Submission(s): 14740Problem DescriptionThe doggie found a bone in an ancient maze, which fascinated him a lot. However, when he picked it up, the maze began to shake, 阅读全文

摘要：畅通工程Time Limit: 4000/2000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 23103Accepted Submission(s): 12042Problem Description某省调查城镇交通状况，得到现有城镇道路统计表，表中列出了每条道路直接连通的城镇。省政府“畅通工程”的目标是使全省任何两个城镇间都可以实现交通（但不一定有直接的道路相连，只要互相间接通过道路可达即可）。问最少还需要建设多少条道路？ Input测试输入包含若干测试用例。每个测试用例的第1行 阅读全文

摘要：诡异的楼梯Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 131072/65536 K (Java/Others)Total Submission(s): 7325Accepted Submission(s): 1736Problem DescriptionHogwarts正式开学以后,Harry发现在Hogwarts里,某些楼梯并不是静止不动的，相反,他们每隔一分钟就变动一次方向. 比如下面的例子里,一开始楼梯在竖直方向,一分钟以后它移动到了水平方向,再过一分钟它又回到了竖直方向.Harry发现对他来说很难找到能使得他最快到达目的地的路 阅读全文

摘要：What Are You Talking AboutTime Limit: 10000/5000 MS (Java/Others)Memory Limit: 102400/204800 K (Java/Others)Total Submission(s): 10593Accepted Submission(s): 3367Problem DescriptionIgnatius is so lucky that he met a Martian yesterday. But he didn't know the language the Martians use. The Martian 阅读全文

摘要：Ignatius and the Princess ITime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 9934Accepted Submission(s): 2972Special JudgeProblem DescriptionThe Princess has been abducted by the BEelzebub feng5166, our hero Ignatius has to rescue our pretty Princess 阅读全文

摘要：SafecrackerTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 6494Accepted Submission(s): 3238Problem Description=== Op tech briefing, 2002/11/02 06:42 CST === "The item is locked in a Klein safe behind a painting in the second-floor library. Kle 阅读全文

摘要：连连看Time Limit: 20000/10000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 14226Accepted Submission(s): 3710Problem Description“连连看”相信很多人都玩过。没玩过也没关系，下面我给大家介绍一下游戏规则：在一个棋盘中，放了很多的棋子。如果某两个相同的棋子，可以通过一条线连起来（这条线不能经过其它棋子），而且线的转折次数不超过两次，那么这两个棋子就可以在棋盘上消去。不好意思，由于我以前没有玩过连连看，咨询了同学的意 阅读全文

摘要：Problem Description怀特先生是一名研究地震的科学家，最近他发现如果知道某一段时间内的地壳震动能量采样的最小波动值之和，可以有效地预测大地震的发生。假设已知一段时间的n次地壳震动能量的采样值为a1,a2,…an，那么第i 次采样的最小波动值为min{|ai-aj| | i 2 #include 3 #include 4 #include 5 #include 6 #define maxn 100001 7 using namespace std; 8 int N; 9 int A[maxn],B[maxn],C[maxn];10 struct Link11 {12 i... 阅读全文

摘要：Problem Description为了测试我们的足球机器人的性能，我们设计如下的测试方法：将一个机器人放在一个n*n的矩形阵列的某个格子中，它每次可以向与它所处的格子相邻的4个格子中的任何一个移动。在这个阵列的一些格子中，摆放着能量，机器人希望能够得到这些能量。但是，这个阵列中存在着两种障碍物，一种障碍物使得机器人无法向前移动进入这个 格子；第二种障碍物机器人虽然可以通过，但是，通过这样一个障碍物的时候，它先前所吃到的所有的能量都将消失。你的任务是，对于给定的一个阵列以及它的描 述，计算出这个机器人所能够获得的最大能量值。 Input本题有多组输入数据，你必须处理到EOF为止输入数据的第. 阅读全文

摘要：1 #include 2 #include 3 #include 4 #include 5 #define INF 1y?y:x 7 using namespace std; 8 int dist[1003],vis[1003]; 9 int map[1003][1003],city[105];10 int N,M,P,Q;11 int Dijkstra()12 {13 int i,j,mark,mindis,min_d;14 memset(vis,0,sizeof(vis));15 for(i=1; i>T;39 while(T--)40 {41 ... 阅读全文