1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73
| #include<iostream> #include<cstdio> #include<cstring> #include<string> #include<vector> using namespace std;
const int CN = 1e5 + 5;
int read(){ int s = 0,ne = 1; char c = getchar(); while(c < '0' || c > '9') ne = c == '-' ? -1 : 1, c = getchar(); while(c >= '0' && c <= '9') s = (s << 1) + (s << 3) + c - '0', c = getchar(); return s * ne; }
class SAM{ public: int len[CN << 1], nxt[CN << 1], son[CN << 1][26], lst, idx; SAM() {nxt[0] = -1, idx = lst = 0;} int et(int c){ int u = ++idx, p = lst; len[u] = len[p] + 1, lst = u; while(p ^ -1 && !son[p][c]) son[p][c] = u, p = nxt[p]; if(p == -1) return idx; int d = son[p][c]; if(len[d] == len[p] + 1) return nxt[u] = d, idx; int v = ++idx; nxt[v] = nxt[d], nxt[d] = nxt[u] = v, len[v] = len[p] + 1, memcpy(son[v], son[d], sizeof(son[d])); while(p ^ -1 && son[p][c] == d) son[p][c] = v, p = nxt[p]; return idx - 1; } } D;
int n, id[CN]; char ch[CN];
vector<int> to[CN]; void rbd(){ for(int i = 1; i <= D.idx; i++) to[ D.nxt[i] ].push_back(i); }
int fa[CN][30], dep[CN]; void dfs(int u, int p){ fa[u][0] = p, dep[u] = dep[p] + 1; int sz = to[u].size(); for(int i = 0; i < sz; i++){ int v = to[u][i]; if(v ^ p) dfs(v, u); } } int lca(int u, int v){ if(dep[u] < dep[v]) swap(u, v); for(int k = 20; k + 1; k--) if(dep[ fa[u][k] ] >= dep[v]) u = fa[u][k]; if(u ^ v) {for(int k = 20; k + 1; k--) if(fa[u][k] ^ fa[v][k]) u = fa[u][k], v = fa[v][k]; u = fa[u][0];} return u; }
int main() { freopen("_in.in", "r", stdin);
cin >> ch; n = strlen(ch); for(int i = n - 1; i + 1; i--) id[i + 1] = D.et( ch[i] - 'a' );
rbd(), dfs(0, 0); for(int k = 1; k <= 20; k++) for(int i = 1; i <= D.idx; i++) fa[i][k] = fa[ fa[i][k - 1] ][k - 1]; int q = read(); while(q--){ int i = read(), j = read(), l = lca( id[i], id[j] ); printf("%d", D.len[l]), puts(""); } }
|