摘要:
New Distinct Substrings(后缀数组) 给定一个字符串,求不相同的子串的个数。$n include using namespace std; const int maxn=50005; int T, n, m=maxn; char s[maxn]; bool cmp(int r, 阅读全文
摘要:
poj 1743 Musical Theme(最长重复子串 后缀数组) 有N(1 include include using namespace std; const int maxn=4e4+5; int n, m, a[maxn]; int x, y, t, wa[maxn], wb[maxn] 阅读全文