摘要： FootballTime Limit:1000MSMemory Limit:65536KTotal Submissions:2116Accepted:1055DescriptionConsider a single-elimination football tournament involving 2nteams, denoted 1, 2, …, 2n. In each round of the tournament, all teams still in the tournament are placed in a list in order of increasing index. Th 阅读全文

摘要： Check the difficulty of problemsTime Limit:2000MSMemory Limit:65536KTotal Submissions:3617Accepted:1580DescriptionOrganizing a programming contest is not an easy job. To avoid making the problems too difficult, the organizer usually expect the contest result satisfy the following two terms:1. All of 阅读全文

摘要： D. Bag of micetime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputThe dragon and the princess are arguing about what to do on the New Year's Eve. The dragon suggests flying to the mountains to watch fairies dancing in the moonlight, while the pri 阅读全文

摘要： LOOPSTime Limit: 15000/5000 MS (Java/Others)Memory Limit: 125536/65536 K (Java/Others)Total Submission(s): 830Accepted Submission(s): 342Problem DescriptionAkemi Homura is a Mahou Shoujo (Puella Magi/Magical Girl).Homura wants to help her friend Madoka save the world. But because of the plot of the 阅读全文

摘要： Coin ChangeSuppose there are 5 types of coins: 50-cent, 25-cent, 10-cent, 5-cent, and 1-cent. We want to make changes with these coins for a given amount of money.For example, if we have 11 cents, then we can make changes with one 10-cent coin and one 1-cent coin, two 5-cent coins and one 1-cent coi 阅读全文

摘要： Problem C: Longest Common SubsequenceSequence 1:Sequence 2:Given two sequences of characters, print the length of the longest common subsequence of both sequences. For example, the longest common subsequence of the following two sequences:abcdgh aedfhr isadhof length 3.Input consists of pairs of lin 阅读全文

摘要： Juice ExtractorJerry loses himself in the interesting game: Fruit Ninja. Fruit Ninja is a game of iPhone and iPad in which the players cut the fruits coming from the bottom of the screen and gain the bonus from cutting more than two fruits with a single slice. Once a fruit is cut, it breaks into sma 阅读全文

摘要： History GradingBackgroundMany problems in Computer Science involve maximizing some measure according to constraints.Consider a history exam in which students are asked to put several historical events into chronological order. Students who order all the events correctly will receive full credit, but 阅读全文

摘要： UVa专题练习A-410003 经典dp，可用四边形不等式优化UVa 10003 - Cutting Sticks 区间dp10029 基础dp，DAG最长路，需高效构图10032 经典问题。子集和数问题。01背包问题10036 能否在一个整数序列的每相邻两项之间添加一个加减号。使最终结果能被一个定整数K整除10051 简单dp。DAG最长路A-510154 dp中等10163 二分、dp10185 二叉树。dp、贪心A-610239 不错的dp，可优化，解决更大规模的问题10271 经典dp，需要证明一个结论10280 dp、最短路10296 中国油路问题，最短路，任意图最大匹配，用集合dp 阅读全文

摘要： 动态规划基础例题LA 3882UVa 3882 - And Then There Was One 递推------------无力orzUVa 1063510635 - Prince and Princess LCS&LISUVa 10891Uva 10891 - Game of Sum dp博弈UVa 11825Uva 11825 - Hackers' Crackdown 状态压缩UVa 10859Uva 10859 - Placing Lampposts 树形dpLA 3983LA 4794简单练习题UVa 11584UVa 11584 - Partitioning by 阅读全文