摘要：
1 const int maxn=50010; 2 int r[maxn],Wa[maxn],Wb[maxn],Wv[maxn],Ws[maxn],rank[maxn],lcp[maxn],sa[maxn]; 3 4 bool cmp(int *p,int i,int j,int l) 5 {ret 阅读全文
摘要：
Longest Common Substring Time Limit: 8000/4000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 5375 Accepted Submission 阅读全文