随笔分类 - 后缀数组
摘要:Power StringsTime Limit:3000MSMemory Limit:65536KTotal Submissions:28859Accepted:12045DescriptionGiven two strings a and b we define a*b to be their concatenation. For example, if a = "abc" and b = "def" then a*b = "abcdef". If we think of concatenation as multiplicatio
阅读全文
摘要:Musical ThemeTime Limit:1000MSMemory Limit:30000KTotal Submissions:16162Accepted:5577DescriptionA musical melody is represented as a sequence of N (1 23 #include 24 #define N 20005 25 int wa[N],wb[N],ws[N],wv[N],wd[N]; 26 int rank[N],height[N]; 27 int Max(int a,int b) 28 { 29 return a>b?a:b; 30 .
阅读全文
摘要:Boring countingTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 1331Accepted Submission(s): 538Problem Description035 now faced a tough problem,his english teacher gives him a string,which consists with n lower case letter,he must figure out how man
阅读全文