随笔分类 - 区间dp
摘要:http://acm.hunnu.edu.cn/online/?action=problem&type=show&id=11544&courseid=0小明的烦恼——找字符串Time Limit:1000ms,Special Time Limit:2500ms,Memory Limit:32768K...
阅读全文
摘要:http://poj.org/problem?id=1505Copying BooksTime Limit:3000MSMemory Limit:10000KTotal Submissions:7053Accepted:2200DescriptionBefore the invention of b...
阅读全文
摘要:http://acm.hdu.edu.cn/showproblem.php?pid=4570Multi-bit TrieTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submi...
阅读全文
摘要:http://acm.hdu.edu.cn/showproblem.php?pid=4283 You Are the OneTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Sub...
阅读全文
摘要:http://poj.org/problem?id=1651Multiplication PuzzleTime Limit:1000MSMemory Limit:65536KTotal Submissions:6188Accepted:3777DescriptionThe multiplicatio...
阅读全文
摘要:http://poj.org/problem?id=3186Treats for the CowsTime Limit:1000MSMemory Limit:65536KTotal Submissions:4041Accepted:2063DescriptionFJ has purchased N ...
阅读全文
摘要:http://poj.org/problem?id=3056The Bavarian Beer PartyTime Limit:6000MSMemory Limit:65536KTotal Submissions:995Accepted:359DescriptionThe professors of...
阅读全文
摘要:http://acm.hdu.edu.cn/showproblem.php?pid=4632题意:一个字符串,有多少个subsequence是回文串。别人的题解:用dp[i][j]表示这一段里有多少个回文串,那首先dp[i][j]=dp[i+1][j]+dp[i][j-1],但是dp[i+1][j]...
阅读全文
摘要:http://acm.hdu.edu.cn/showproblem.php?pid=3280用了简单的枚举。Equal Sum PartitionsTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Othe...
阅读全文
摘要:http://acm.hdu.edu.cn/showproblem.php?pid=2476 String painterTime Limit: 5000/2000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Subm...
阅读全文
摘要:http://poj.org/problem?id=2955BracketsTime Limit:1000MSMemory Limit:65536KTotal Submissions:2707Accepted:1403DescriptionWe give the following inductiv...
阅读全文

浙公网安备 33010602011771号