2013年4月23日

UVa 10192 - Vacation 字符串dp

摘要: Problem E: VacationThe ProblemYou are planning to take some rest and to go out on vacation, but you really don't know which cities you should visit. So, you ask your parents for help. Your mother says"My son, you MUST visit Paris, Madrid, Lisboa and London. But it's only fun in this ord 阅读全文

posted @ 2013-04-23 21:38 电子幼体 阅读(160) 评论(0) 推荐(0) 编辑

10131 - Is Bigger Smarter? 水dp

摘要: Question 1: Is Bigger Smarter?The ProblemSome people think that the bigger an elephant is, the smarter it is. To disprove this, you want to take the data on a collection of elephants and put as large a subset of this data as possible into a sequence so that the weights are increasing, but the IQ' 阅读全文

posted @ 2013-04-23 20:53 电子幼体 阅读(129) 评论(0) 推荐(0) 编辑

hdu 3415 Max Sum of Max-K-sub-sequence 单调队列dp

摘要: Max Sum of Max-K-sub-sequenceTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 4581Accepted Submission(s): 1656Problem DescriptionGiven a circle sequence A[1],A[2],A[3]......A[n]. Circle sequence means the left neighbour of A[1] is A[n] , and the rig 阅读全文

posted @ 2013-04-23 16:46 电子幼体 阅读(149) 评论(0) 推荐(0) 编辑

poj 3071 football 概率dp

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

posted @ 2013-04-23 09:53 电子幼体 阅读(131) 评论(0) 推荐(0) 编辑

导航