Marcus

题目DescriptionThe little cat is majoring in physics in the capital of Byterland. A piece of sad news comes to him these days: his mother is getting ill. Being worried about spending so much on railway t

题目Corporate Identity Time Limit: 3000MS Memory Limit: 65536KDescriptionBeside other services, ACM helps companies to clearly state their “corporate identity”, which includes company logo but also oth

题目Substrings Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 14254 Accepted: 5064 DescriptionYou are given a number of case-sensitive strings of alphabetic characters, find th

题目Common Substrings Time Limit: 5000MS Memory Limit: 65536K Total Submissions: 10932 Accepted: 3622 DescriptionA substring of a string T is defined as:T(i, k)=TiTi+1…Ti+k-1, 1≤i≤i+k-1≤|T

sa终于学习了一波sa sa的大概思想其实就是先把每一个i开头，长度为1的字符串排序，再通过前面的结果，用倍增的方法求出每一个i开头，长度为2k2^k的字符串的排名 设sa[i]表示排名第i的后缀开头的位置，rank[i]为以i开头的后缀的排名，height[i]表示sa[i]和sa[i-1]的lcp（最长公共前缀） 假设现在我们在对以i开头，长度为k的字符串排序，那么我们是已经知道长度为k/