Girls' researchTime Limit: 3000/1000 MS (Java/Others) Memory Limit: 65535/32768 K (Java/Others)Total Submission(s): 4401 Accepted Submission(s): 1642 Problem Description One day, sailormoon girls are so delighted that they intend to research about pa…
Problem Description One day, sailormoon girls are so delighted that they intend to research about palindromic strings. Operation contains two steps:First step: girls will write a long string (only contains lower case) on the paper. For example, "abcd…
题目地址 manacher #include<cstdio> #include<string.h> #include<algorithm> using namespace std; ; char s[Nmax]; +]; +]; +]; int id; int maxlen; int len; int start; int endd; void init() { id=; maxlen=; int n=strlen(s); str[]='$'; str[]='#'; ;…
Meeting Time Limit: 12000/6000 MS (Java/Others) Memory Limit: 262144/262144 K (Java/Others)Total Submission(s): 3361 Accepted Submission(s): 1073 Problem Description Bessie and her friend Elsie decide to have a meeting. However, after Farmer Jo…
题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=1711 Time Limit: 10000/5000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Problem Description Given two sequences of numbers : a[1], a[2], ...... , a[N], and b[1], b[2], ...... , b[M] (1 <=…
