07 2012 档案

hdu1811 拓扑排序+并查集
摘要：Rank of Tetris Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 2411 Accepted Submission(s): 657 Problem Description自从Lele开发了Rating系统，他的Tetris事业更是如虎添翼，不久他遍把这个游戏推向了全球。为了更好的符合那些爱好者的喜好，Lele又想了一个新点子：他将制作一个全球Tetris高手排行榜，定时更新，名堂要比福布斯富豪榜还响。关于如何排名，这个不用说都知 阅读全文
posted @ 2012-07-28 00:46 _sunshine 阅读(1546) 评论(0) 推荐(1)
hdu1285 拓扑排序（裸）
摘要：确定比赛名次 Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 5626 Accepted Submission(s): 2085 Problem Description有N个比赛队（1<=N<=500），编号依次为1，2，3，。。。。，N进行比赛，比赛结束后，裁判委员会要将所有参赛队伍从前往后依次排名，但现在裁判委员会不能直接获得每个队的比赛成绩，只知道每场比赛的结果，即P1赢P2，用P1，P2表示，排名时P1在P2之前。现在请 阅读全文
posted @ 2012-07-27 14:07 _sunshine 阅读(474) 评论(0) 推荐(0)
博弈
摘要：一批文章：http://hi.baidu.com/liveroom/blog/category/%B2%A9%DE%C4%C2%DBhttp://blog.csdn.net/logic_nut/archive/2009/10/21/4706649.aspxhttp://blog.csdn.net/logic_nut/archive/2009/10/22/4711489.aspxhttp://yjq24.blogbus.com/tag/%E5%8D%9A%E5%BC%88/http://hi.baidu.com/%C3%D7%C0%BCloveac/blog/category/%B2%A9%DE 阅读全文
posted @ 2012-07-27 02:52 _sunshine 阅读(247) 评论(0) 推荐(0)
hrbust1218 最短路 Car的旅行路线
摘要：（由于图片无法显示，链接：http://acm.hrbust.edu.cn/index.php?m=ProblemSet&a=showProblem&problem_id=1218）View Code 1 #include<stdio.h> 2 #include<stdlib.h> 3 #include<string.h> 4 #include<math.h> 5 const int M=600; 6 const int INF=1<<28; 7 int c,n,a,b,x[M],y[M],t,ta; 8 double 阅读全文
posted @ 2012-07-26 11:17 _sunshine 阅读(260) 评论(0) 推荐(0)
hdu1874（ 裸） 最短路 Dijkstra
摘要：畅通工程续Time Limit: 3000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 12541 Accepted Submission(s): 4247 Problem Description某省自从实行了很多年的畅通工程计划后，终于修建了很多路。不过路多了也不好，每次要从一个城镇到另一个城镇时，都有许多种道路方案可以选择，而某些方案要比另一些方案行走的距离要短很多。这让行人很困扰。现在，已知起点和终点，请你计算出要从起点到终点，最短需要行走多少距离。Input本题 阅读全文
posted @ 2012-07-25 23:50 _sunshine 阅读(367) 评论(0) 推荐(0)
hdu2063 二分图的匈牙利匹配
摘要：过山车Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 4769 Accepted Submission(s): 2064 Problem DescriptionRPG girls今天和大家一起去游乐场玩，终于可以坐上梦寐以求的过山车了。可是，过山车的每一排只有两个座位，而且还有条不成文的规矩，就是每个女生必须找个个男生做partner和她同坐。但是，每个女孩都有各自的想法，举个例子把，Rabbit只愿意和XHD或PQK做partner，G. 阅读全文
posted @ 2012-07-25 19:53 _sunshine 阅读(297) 评论(0) 推荐(0)
HDU1116 欧拉回路/通路
摘要：Play on WordsTime Limit: 10000/5000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 2775 Accepted Submission(s): 881 Problem DescriptionSome of the secret doors contain a very interesting word puzzle. The team of archaeologists has to solve it to open that doors. Beca 阅读全文
posted @ 2012-07-25 16:28 _sunshine 阅读(681) 评论(0) 推荐(0)
HRBUST 1213 单词接龙 NOIP2000
摘要：单词接龙Time Limit: 1000 MSMemory Limit: 65535 KTotal Submit: 7(3 users)Total Accepted: 3(3 users)Special Judge: NoDescription 单词接龙是一个与我们经常玩的成语接龙相类似的游戏，现在我们已知一组单词，且给定一个开头的字母，要求出以这个字母开头的最长的“龙”（每个单词都最多在“龙”中出现两次），在两个单词相连时，其重合部分合为一部分，例如 beast和astonish，如果接成一条龙则变为beastonish，另外相邻的两部分不能存在包含关系，例如at 和 atide 间不能相连 阅读全文
posted @ 2012-07-25 00:43 _sunshine 阅读(1282) 评论(0) 推荐(0)
POJ1240 m叉树
摘要：Pre-Post-erous!Time Limit: 1000MSMemory Limit: 10000KTotal Submissions: 1915Accepted: 1158DescriptionWe are all familiar with pre-order, in-order and post-order traversals of binary trees. A common problem in data structure classes is to find the pre-order traversal of a binary tree when given the i 阅读全文
posted @ 2012-07-24 17:34 _sunshine 阅读(390) 评论(0) 推荐(0)
POJ 2255 二叉树遍历
摘要：Tree RecoveryTime Limit: 1000MSMemory Limit: 65536KTotal Submissions: 7997Accepted: 5079DescriptionLittle Valentine liked playing with binary trees very much. Her favorite game was constructing randomly looking binary trees with capital letters in the nodes. This is an example of one of her creation 阅读全文
posted @ 2012-07-24 13:23 _sunshine 阅读(1452) 评论(0) 推荐(0)
POJ1837 DP balance
摘要：BalanceTime Limit: 1000MSMemory Limit: 30000KTotal Submissions: 7086Accepted: 4264DescriptionGigel has a strange "balance" and he wants to poise it. Actually, the device is different from any other ordinary balance. It orders two arms of negligible weight and each arm's length is 15. S 阅读全文
posted @ 2012-07-24 11:19 _sunshine 阅读(1023) 评论(0) 推荐(0)
POJ2677 DP tour 双调欧几里得旅行商问题
摘要：TourTime Limit: 1000MSMemory Limit: 65536KTotal Submissions: 2699Accepted: 1193DescriptionJohn Doe, a skilled pilot, enjoys traveling. While on vacation, he rents a small plane and starts visiting beautiful places. To save money, John must determine the shortest closed tour that connects his destina 阅读全文
posted @ 2012-07-23 17:07 _sunshine 阅读(2555) 评论(1) 推荐(0)
hdu1561 树形DP
摘要：The more, The Better Time Limit: 6000/2000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 2753 Accepted Submission(s): 1637 Problem DescriptionACboy很喜欢玩一种战略游戏，在一个地图上，有N座城堡，每座城堡都有一定的宝物，在每次游戏中ACboy允许攻克M个城堡并获得里面的宝物。但由于地理位置原因，有些城堡不能直接攻克，要攻克这些城堡必须先攻克其他某一个特定的城堡。你能帮ACboy算.. 阅读全文
posted @ 2012-07-23 01:01 _sunshine 阅读(1094) 评论(0) 推荐(0)
POJ1192 树形DP 最优连通子集
摘要：最优连通子集Time Limit: 1000MSMemory Limit: 10000KTotal Submissions: 1837Accepted: 947Description众所周知，我们可以通过直角坐标系把平面上的任何一个点P用一个有序数对(x, y)来唯一表示，如果x, y都是整数，我们就把点P称为整点，否则点P称为非整点。我们把平面上所有整点构成的集合记为W。 定义1 两个整点P1(x1, y1), P2(x2, y2)，若|x1-x2| + |y1-y2| = 1，则称P1, P2相邻，记作P1~P2，否则称P1, P2不相邻。 定义 2 设点集S是W的一个有限子集，即S = 阅读全文
posted @ 2012-07-23 00:03 _sunshine 阅读(995) 评论(0) 推荐(0)
POJ1745
摘要：DivisibilityTime Limit: 1000MSMemory Limit: 10000KTotal Submissions: 8346Accepted: 2891DescriptionConsider an arbitrary sequence of integers. One can place + or - operators between integers in the sequence, thus deriving different arithmetical expressions that evaluate to different values. Let us, . 阅读全文
posted @ 2012-07-19 11:23 _sunshine 阅读(549) 评论(0) 推荐(0)