long long ago

GRE Words RevengeTime Limit: 20000/10000 MS (Java/Others)    Memory Limit: 327680/327680 K (Java/Others)Total Submission(s): 1004    Accepted Submission(s): 215Problem Description　　Now

manacher算法介绍先用求回文串的Manacher算法，求出以第i个点和第i+1个点为中心的回文串长度，记录到数组c中 比如 10 9 8 8 9 10 10 9 8 我们通过运行Manacher求出第i个点和第i+1个点为中心的回文串长度 0 0 6 0 0 6 0 0 0两个8为中心，10 9 8 8 9 10是个回文串，长度是6。 两个10为中心，8 9 10 10

Given a set of pattern strings, and a text, you have to find, if any of the pattern is a substring of the text. If any of the pattern string can be found in text, then print “yes”, otherwise “no” (wit

解码后就是裸AC自动机。。。

病毒侵袭Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 10518    Accepted Submission(s): 2730Problem Description当太阳的光辉逐渐被月亮遮蔽，世界失去了光