2013年09月_疯狂的橡树

原创 poj 2443 Set Operation(思维&状态压缩)

Set OperationTime Limit: 3000MS Memory Limit: 65536KTotal Submissions: 2341 Accepted: 907DescriptionYou are given N sets, the i-th set (represent by S(i)) have C(

2013-09-30 23:53:02 1532 1

原创 poj 3419 Difference Is Beautiful (开始的方法复杂度还是没降下去附o(n*log(n)))的方法

Difference Is BeautifulTime Limit: 5000MS Memory Limit: 65536KTotal Submissions: 1863 Accepted: 569DescriptionMr. Flower's business is growing much faster than or

2013-09-30 23:29:44 1435

原创 poj 3040 Allowance(贪心)

AllowanceTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 867 Accepted: 383DescriptionAs a reward for record milk production, Farmer John has decided to

2013-09-30 09:58:21 2383

原创 hdu 1080 Human Gene Functions(LCS&DP)

Human Gene FunctionsTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 1892 Accepted Submission(s): 1083Problem DescriptionIt is wel

2013-09-27 20:33:25 1044

原创 hdu 1159 Common Subsequence(LCS最长公共子序列)

Common SubsequenceTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 18387 Accepted Submission(s): 7769Problem DescriptionA subseque

2013-09-27 13:19:38 1281

原创 [IOI1999]花店橱窗布置（DP路径记录）

题目:[IOI1999]花店橱窗布置问题编号:496题目描述某花店现有F束花，每一束花的品种都不一样，同时至少有同样数量的花瓶，被按顺序摆成一行，花瓶的位置是固定的，从左到右按1到V顺序编号，V是花瓶的数目。花束可以移动，并且每束花用1到F的整数标识。如果I 每个花瓶的形状和颜色也不相同，因此，当各个花瓶中放入不同的花束时，会产生不同的美学效果，并以美学值（一个整数）来

2013-09-27 00:53:32 2603

原创题目:[NOIP1999]拦截导弹(最长非递增子序列DP) O(n^2)和O(n*log(n))的两种做法

题目:[NOIP1999]拦截导弹问题编号:217题目描述某国为了防御敌国的导弹袭击，发展出一种导弹拦截系统。但是这种导弹拦截系统有一个缺陷：虽然它的第一发炮弹能够到达任意的高度，但是以后每一发炮弹都不能高于前一发的高度。某天，雷达捕捉到敌国的导弹来袭。由于该系统还在试用阶段，所以只有一套系统，因此有可能不能拦截所有的导弹。输入格式输入数据为两行，第一行

2013-09-26 22:41:54 1581

原创 hdu 2222 Keywords Search（ac自动机模板题，但是有陷阱）

Keywords SearchTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 27477 Accepted Submission(s): 9024Problem DescriptionIn the modern

2013-09-16 20:40:13 1170

原创 poj 1961 Period（KMP训练指南例题）

PeriodTime Limit: 3000MS Memory Limit: 30000KTotal Submissions: 11356 Accepted: 5279DescriptionFor each prefix of a given string S with N characters (each charact

2013-09-15 20:08:36 1486

原创 poj 2406 Power Strings(KMP变形)

Power StringsTime Limit: 3000MS Memory Limit: 65536KTotal Submissions: 28102 Accepted: 11755DescriptionGiven two strings a and b we define a*b to be their concate

2013-09-15 19:37:20 1222

原创 poj 2752 Seek the Name, Seek the Fame(KMP需转换下思想)

Seek the Name, Seek the FameTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 10204 Accepted: 4921DescriptionThe little cat is so famous, that many couple

2013-09-15 00:38:25 1801

原创 poj 3461 Oulipo(KMP裸题)

OulipoTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 17928 Accepted: 7212DescriptionThe French author Georges Perec (1936–1982) once wrote a book, La d

2013-09-15 00:06:16 2014

原创 hdu 2871 Memory Control (线段树&vector)

Memory ControlTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3900 Accepted Submission(s): 936Problem DescriptionMemory units are

2013-09-13 20:00:03 1164

原创 LA 3942 Remember the Word(前缀树&树上DP)

3942 - Remember the WordNeal is very curious about combinatorial problems, and now here comes a problem about words. Knowing that Ray has a photographic memory and this may not trouble him, Neal

2013-09-10 22:57:09 1489

原创 Codeforces Round #199 (Div. 2)

A. Xenia and Divisorstime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputXenia the mathematician has a sequenc

2013-09-09 23:02:34 1947 1

原创 Codeforces Round #198 (Div. 2)

A. The Walltime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputIahub and his friend Floyd have started painting

2013-09-09 22:43:08 1130

原创 Codeforces Round #197 (Div. 2)

A. Helpful Mathstime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputXenia the beginner mathematician is a thir

2013-09-09 22:29:28 1663

原创 hdu 1540 Tunnel Warfare(线段树区间统计)

Tunnel WarfareTime Limit: 4000/2000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 3293 Accepted Submission(s): 1272Problem DescriptionDuring the War

2013-09-09 20:06:28 1374

原创 hdu 4586 Play the Dice(水期望DP)

Play the DiceTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65535/32768 K (Java/Others)Total Submission(s): 308 Accepted Submission(s): 136Special JudgeProblem DescriptionThere

2013-09-06 22:13:22 1112

原创 hdu 4055 Number String(有点思维的DP)

Number StringTime Limit: 10000/5000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1016 Accepted Submission(s): 440Problem DescriptionThe signature of

2013-09-05 23:08:29 1078

原创 ZJUT 1423 地下迷宫(期望DP&高斯消元)

地下迷宫 Time Limit:1000MS Memory Limit:32768KDescription:由于山体滑坡，DK被困在了地下蜘蛛王国迷宫。为了抢在DH之前来到TFT，DK必须尽快走出此迷宫。此迷宫仅有一个出口，而由于大BOSS的力量减弱影响到了DK，使DK的记忆力严重下降，他甚至无法记得他上一步做了什么。所以他只能每次等概率随机的选取一个方向走。当然他不会选取周

2013-09-04 13:29:11 1388

记录成长的点点滴滴. . . . .