_sunshine

摘要： 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 阅读全文

摘要： 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 阅读全文

摘要： 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 阅读全文

摘要： 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 阅读全文

摘要： 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算.. 阅读全文

摘要： 最优连通子集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 = 阅读全文

摘要： 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, . 阅读全文

摘要： http://acm.hrbeu.edu.cn/index.php?act=problem&id=1005&cid=74 Kth Largest TimeLimit: 1 Second MemoryLimit: 32 Megabyte Description There are two sequen 阅读全文