08 2013 档案

HDU 3072 Intelligence System （强连通缩点+简单最小树形图，4级）
摘要：D - Intelligence SystemCrawling in process...Crawling failedTime Limit:1000MSMemory Limit:32768KB 64bit IO Format:%I64d & %I64uSubmitStatus Appoint de... 阅读全文
posted @ 2013-08-31 21:35 剑不飞 阅读(131) 评论(0) 推荐(0)
HDU 2121 Ice_cream’s world II (最小树形图+虚点，4级)
摘要：C - Ice_cream’s world IICrawling in process...Crawling failedTime Limit:1000MSMemory Limit:32768KB 64bit IO Format:%I64d & %I64uSubmitStatus Practice ... 阅读全文
posted @ 2013-08-31 20:39 剑不飞 阅读(144) 评论(0) 推荐(0)
UVA 11183 Teen Girl Squad （最小树形图，3级）
摘要：B - Teen Girl SquadCrawling in process...Crawling failedTime Limit:3000MSMemory Limit:0KB 64bit IO Format:%lld & %lluSubmitStatus Appoint description:... 阅读全文
posted @ 2013-08-31 19:32 剑不飞 阅读(267) 评论(0) 推荐(0)
最小树形图
摘要：最小树形图，就是给有向带权图中指定一个特殊的点root，求一棵以root为根的有向生成树T，并且T中所有边的总权值最小。最小树形图的第一个算法是1965年朱永津和刘振宏提出的复杂度为O(VE)的算法。判断是否存在树形图的方法很简单，只需要以v为根作一次图的遍历就可以了，所以下面的算法中不再考虑树形图... 阅读全文
posted @ 2013-08-31 18:50 剑不飞 阅读(244) 评论(0) 推荐(0)
POJ 3164 Command Network (最小树形图模板，3级)
摘要：Command NetworkTime Limit:1000MSMemory Limit:131072KTotal Submissions:10662Accepted:3110DescriptionAfter a long lasting war on words, a war on arms fi... 阅读全文
posted @ 2013-08-31 18:23 剑不飞 阅读(193) 评论(0) 推荐(0)
UVALive 4643 Twenty Questions （压缩DP，4级）
摘要：O - Twenty QuestionsCrawling in process...Crawling failedTime Limit:3000MSMemory Limit:0KB 64bit IO Format:%lld & %lluSubmitStatus Appoint description... 阅读全文
posted @ 2013-08-30 20:48 剑不飞 阅读(240) 评论(0) 推荐(0)
POJ 1625 Censored! （AC自动机+DP+高精度，5级）
摘要：G - Censored!Crawling in process...Crawling failedTime Limit:5000MSMemory Limit:10000KB 64bit IO Format:%I64d & %I64uSubmitStatus Appoint description:... 阅读全文
posted @ 2013-08-29 21:50 剑不飞 阅读(194) 评论(0) 推荐(0)
UVALive 2031 Dance Dance Revolution （舞步转移，状态压缩DP，4级）
摘要：N - Dance Dance RevolutionCrawling in process...Crawling failedTime Limit:3000MSMemory Limit:0KB 64bit IO Format:%lld & %lluSubmitStatus Appoint descr... 阅读全文
posted @ 2013-08-29 09:55 剑不飞 阅读(226) 评论(0) 推荐(0)
UVALive 3363 String Compression （区间DP，4级）
摘要：M - String CompressionCrawling in process...Crawling failedTime Limit:3000MSMemory Limit:0KB 64bit IO Format:%lld & %lluSubmitStatus Appoint descripti... 阅读全文
posted @ 2013-08-28 19:32 剑不飞 阅读(208) 评论(0) 推荐(0)
UVA 11404 Palindromic Subsequence (去除字符DP，4级)
摘要：E - Palindromic SubsequenceCrawling in process...Crawling failedTime Limit:3000MSMemory Limit:0KB 64bit IO Format:%lld & %lluSubmitStatus Appoint desc... 阅读全文
posted @ 2013-08-28 16:50 剑不飞 阅读(202) 评论(0) 推荐(0)
UVA 11552 Fewest Flops （序列划分DP，4级）
摘要：D - Fewest FlopsCrawling in process...Crawling failedTime Limit:2000MSMemory Limit:0KB 64bit IO Format:%lld & %lluSubmitStatus Appoint description: De... 阅读全文
posted @ 2013-08-28 16:47 剑不飞 阅读(336) 评论(0) 推荐(0)
UVA 10534 Wavio Sequence （波浪DP，4级）
摘要：C - Wavio SequenceCrawling in process...Crawling failedTime Limit:3000MSMemory Limit:0KB 64bit IO Format:%lld & %lluSubmitStatusAppoint description: ... 阅读全文
posted @ 2013-08-28 16:41 剑不飞 阅读(166) 评论(0) 推荐(0)
UVALive 4256 Salesmen （树DP，4级）
摘要：B - SalesmenCrawling in process...Crawling failedTime Limit:3000MSMemory Limit:0KB 64bit IO Format:%lld & %lluSubmitStatus Appoint description: Descri... 阅读全文
posted @ 2013-08-28 16:37 剑不飞 阅读(185) 评论(0) 推荐(0)
UVA 11584 Partitioning by Palindromes （回文DP，4级）
摘要：A - Partitioning by PalindromesCrawling in process...Crawling failedTime Limit:1000MSMemory Limit:0KB64bit IO Format:%lld & %lluSubmitStatusAppoint de... 阅读全文
posted @ 2013-08-28 16:30 剑不飞 阅读(200) 评论(0) 推荐(0)
UVALive 2038 Strategic game （树形DP，4级）
摘要：L - Strategic gameCrawling in process...Crawling failedTime Limit:3000MSMemory Limit:0KB 64bit IO Format:%lld & %lluSubmitStatus Appoint description: ... 阅读全文
posted @ 2013-08-28 16:18 剑不飞 阅读(182) 评论(0) 推荐(0)
CodeForces 55D Beautiful numbers （数位DP+状态简化，5级）
摘要：J - Beautiful numbersCrawling in process...Crawling failedTime Limit:4000MSMemory Limit:262144KB 64bit IO Format:%I64d & %I64u SubmitStatus Appoint de... 阅读全文
posted @ 2013-08-28 14:52 剑不飞 阅读(192) 评论(0) 推荐(0)
后缀数组——处理字符串的有力工具
摘要：后缀数组——处理字符串的有力工具作者：罗穗骞２００９年１月 【摘要】 后缀数组是处理字符串的有力工具。后缀数组是后缀树的一个非常精巧的替代品，它比后缀树容易编程实现，能够实现后缀树的很多功能而时间复杂度也并不逊色，而且它比后缀树所占用的内存空间小很多。可以说，在信息学竞赛中后缀数组比后缀树要更为... 阅读全文
posted @ 2013-08-27 21:25 剑不飞 阅读(692) 评论(0) 推荐(0)
hdu 2243 考研路茫茫――单词情结(AC自动机+矩阵快速幂，4级)
摘要：F - 考研路茫茫――单词情结Crawling in process...Crawling failedTime Limit:1000MSMemory Limit:32768KB 64bit IO Format:%I64d & %I64uSubmitStatus Appoint descriptio... 阅读全文
posted @ 2013-08-27 20:29 剑不飞 阅读(193) 评论(0) 推荐(0)
POJ 2778 DNA Sequence （AC自动机+矩阵加速，4级）
摘要：E - DNA SequenceCrawling in process...Crawling failedTime Limit:1000MSMemory Limit:65536KB 64bit IO Format:%I64d & %I64uSubmitStatus Appoint descripti... 阅读全文
posted @ 2013-08-27 19:03 剑不飞 阅读(219) 评论(0) 推荐(0)
SPOJ 10606. Balanced Numbers （数位DP,4级）
摘要：10606. Balanced NumbersProblem code: BALNUMBalanced numbers have been used by mathematicians for centuries. A positive integer is considered a balance... 阅读全文
posted @ 2013-08-26 12:35 剑不飞 阅读(205) 评论(0) 推荐(0)
ZOJ 3494 BCD Code (AC自动机+数位DP，5级)
摘要：BCD CodeTime Limit: 5 Seconds Memory Limit: 65536 KB Binary-coded decimal (BCD) is an encoding for decimal numbers in which each digit is represented... 阅读全文
posted @ 2013-08-25 16:30 剑不飞 阅读(260) 评论(0) 推荐(0)
hdu 2825 Wireless Password（AC自动机+压缩DP，5级）
摘要：Wireless PasswordTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3369Accepted Submission(s): 1003P... 阅读全文
posted @ 2013-08-25 10:34 剑不飞 阅读(197) 评论(0) 推荐(0)
hdu 4691 Front compression(LCP+RMQ || hash,5级)
摘要：Front compressionTime Limit: 5000/5000 MS (Java/Others)Memory Limit: 102400/102400 K (Java/Others)Total Submission(s): 678Accepted Submission(s): 275P... 阅读全文
posted @ 2013-08-23 10:57 剑不飞 阅读(248) 评论(0) 推荐(0)
hdu 4507 吉哥系列故事——恨7不成妻(数位DP，5级)
摘要：吉哥系列故事——恨7不成妻Time Limit: 1000/500 MS (Java/Others)Memory Limit: 65535/32768 K (Java/Others)Total Submission(s): 957Accepted Submission(s): 300Problem ... 阅读全文
posted @ 2013-08-20 09:41 剑不飞 阅读(170) 评论(0) 推荐(0)
hdu 3709 Balanced Number(数位DP，5级)
摘要：Balanced NumberTime Limit: 10000/5000 MS (Java/Others)Memory Limit: 65535/65535 K (Java/Others)Total Submission(s): 1270Accepted Submission(s): 553Pro... 阅读全文
posted @ 2013-08-19 20:37 剑不飞 阅读(157) 评论(0) 推荐(0)
hdu 4352 XHXJ's LIS(LIS+数位DP，5级)
摘要：XHXJ's LISTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 529Accepted Submission(s): 219Problem De... 阅读全文
posted @ 2013-08-19 17:07 剑不飞 阅读(226) 评论(0) 推荐(0)
poj 3252 Round Numbers(数位ＤＰ，４级)
摘要：Round NumbersTime Limit:2000MSMemory Limit:65536KTotal Submissions:7481Accepted:2562DescriptionThe cows, as you know, have no fingers or thumbs and th... 阅读全文
posted @ 2013-08-19 15:32 剑不飞 阅读(168) 评论(0) 推荐(0)
hdu 3555 Bomb(数位DP，4级)
摘要：BombTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 131072/65536 K (Java/Others)Total Submission(s): 4443Accepted Submission(s): 1538Problem Descr... 阅读全文
posted @ 2013-08-19 11:41 剑不飞 阅读(180) 评论(0) 推荐(0)
hdu 3652 B-number(数位DP，4级)
摘要：B-numberTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1497Accepted Submission(s): 820Problem Des... 阅读全文
posted @ 2013-08-19 11:29 剑不飞 阅读(141) 评论(0) 推荐(0)
ural 1057. Amount of Degrees(数位DP，4级)
摘要：1057. Amount of DegreesTime limit: 1.0 secondMemory limit: 64 MBCreate a code to determine the amount of integers, lying in the set [X;Y] and being a ... 阅读全文
posted @ 2013-08-18 20:17 剑不飞 阅读(181) 评论(0) 推荐(0)
2013南京邀请赛C题/njustOJ 1739 - Count The Carries
摘要：Count The CarriesTime Limit: 4000/2000 MS (Java/Others)Memory Limit: 65535/32768 K (Java/Others)Total Submission(s): 0Accepted Submission(s): 0Problem... 阅读全文
posted @ 2013-08-17 15:17 剑不飞 阅读(199) 评论(0) 推荐(0)
uva 10817 Headmaster's Headache(DP 3进制压缩,4级)
摘要：K -Headmaster's HeadacheTime Limit:3000MSMemory Limit:0KB64bit IO Format:%lld & %lluSubmitStatusAppoint description:DescriptionProblem D: Headmaster's... 阅读全文
posted @ 2013-08-16 16:04 剑不飞 阅读(206) 评论(0) 推荐(0)
hdu 4678 Mine(博弈SG，4级)
摘要：MineTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65535/32768 K (Java/Others)Total Submission(s): 487Accepted Submission(s): 134Problem Descript... 阅读全文
posted @ 2013-08-16 14:01 剑不飞 阅读(187) 评论(0) 推荐(0)
hdu 4685 Prince and Princess(最大匹配+强连通所点，5级)
摘要：Prince and PrincessTime Limit: 6000/3000 MS (Java/Others)Memory Limit: 65535/32768 K (Java/Others)Total Submission(s): 248Accepted Submission(s): 76Pr... 阅读全文
posted @ 2013-08-16 13:20 剑不飞 阅读(211) 评论(0) 推荐(0)
hdu 4681 String (DP,4级)
摘要：StringTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65535/32768 K (Java/Others)Total Submission(s): 122Accepted Submission(s): 48Problem Descrip... 阅读全文
posted @ 2013-08-15 18:40 剑不飞 阅读(134) 评论(0) 推荐(0)
hdu 4679 Terrorist’s destroy (DP or 树直径，4级)
摘要：Terrorist’s destroyTime Limit: 6000/3000 MS (Java/Others)Memory Limit: 65535/32768 K (Java/Others)Total Submission(s): 132Accepted Submission(s): 20Pr... 阅读全文
posted @ 2013-08-15 18:35 剑不飞 阅读(200) 评论(0) 推荐(0)
hdu 4666 Hyperspace(STL)
摘要：HyperspaceTime Limit: 20000/10000 MS (Java/Others)Memory Limit: 65535/65535 K (Java/Others)Total Submission(s): 651Accepted Submission(s): 295Problem DescriptionThe great Mr.Smith has invented a hyperspace particle generator. The device is very powerful. The device can generate a hyperspace. In the 阅读全文
posted @ 2013-08-14 20:39 剑不飞 阅读(210) 评论(0) 推荐(0)
hdu 4650 Minimum Average Weight Path（最短路，5级）
摘要：第4场多校联合训练解题报告——详见杭电ACM微博~Minimum Average Weight PathTime Limit: 20000/10000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(... 阅读全文
posted @ 2013-08-07 16:47 剑不飞 阅读(203) 评论(0) 推荐(0)
hdu 4671 Partition(DP,整数划分，5级)
摘要：PartitionTime Limit: 6000/3000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 114Accepted Submission(s): 46Problem Desc... 阅读全文
posted @ 2013-08-06 19:57 剑不飞 阅读(262) 评论(0) 推荐(0)
hdu 4396 More lumber is required(最短路，SPFA，4级)
摘要：More lumber is requiredTime Limit: 10000/5000 MS (Java/Others)Memory Limit: 102400/102400 K (Java/Others)Total Submission(s): 909Accepted Submission(s... 阅读全文
posted @ 2013-08-04 20:20 剑不飞 阅读(241) 评论(0) 推荐(0)
hdu 1853 Cyclic Tour(费用流OR二分图最佳匹配，5级)
摘要：O -Cyclic TourTime Limit:1000MSMemory Limit:65535KB64bit IO Format:%I64d & %I64uSubmitStatusAppoint description:DescriptionThere are N cities in our c... 阅读全文
posted @ 2013-08-03 15:23 剑不飞 阅读(124) 评论(0) 推荐(0)
hdu 2686 Matrix(多线程DPor费用流，5级)
摘要：P -MatrixTime Limit:1000MSMemory Limit:32768KB64bit IO Format:%I64d & %I64uSubmitStatusAppoint description:DescriptionYifenfei very like play a number... 阅读全文
posted @ 2013-08-03 14:30 剑不飞 阅读(179) 评论(0) 推荐(0)
hdu 4640 Island and study-sister(压缩DP+最短路,5级)
摘要：第4场多校联合训练解题报告——详见杭电ACM微博~Island and study-sisterTime Limit: 4000/2000 MS (Java/Others)Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): ... 阅读全文
posted @ 2013-08-02 19:34 剑不飞 阅读(173) 评论(0) 推荐(0)
hdu 4638 Group（线段树，离线维护左边界，4级）
摘要：GroupTime Limit: 4000/2000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 369Accepted Submission(s): 207Problem Descrip... 阅读全文
posted @ 2013-08-02 15:36 剑不飞 阅读(153) 评论(0) 推荐(0)