摘要：题目链接: Palindrome Time Limit: 6000/3000 MS (Java/Others) Memory Limit: 262144/262144 K (Java/Others)Total Submission(s): 113 Accepted Submission(s): 44 阅读全文

摘要：题目链接： Suffix Consider n given non-empty strings denoted by s1 , s2 , · · · , sn . Now for each of them, you need to select a corresponding suffix, den 阅读全文

摘要：题目链接： Sequence I Time Limit: 3000/1500 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 687 Accepted Submission(s): 262 阅读全文

摘要：题目链接： Another Meaning Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others) Problem Description As is known to all, in many 阅读全文

摘要：题意： 给出一个由多个不同单词组成的字典,和一个长字符串,把这个字符串分解成若干个单词的连接,问有多少种方法; 思路： dp[i]表示s[i,L]的方案数,d[i]=∑d[j];s[i,j-1]是一个字典里的单词; 一开始想用mp搞,最后t了;换成了trie树,由于单词的长度不超过100,所以就可以 阅读全文

摘要：题目链接： D. Alyona and Strings time limit per test 2 seconds memory limit per test 256 megabytes input standard input output standard output time limit p 阅读全文

摘要：题目链接： C. Reberland Linguistics time limit per test 1 second memory limit per test 256 megabytes input standard input output standard output time limit 阅读全文