Method lcp

code/strings/suffix_array.cpp:19–25

          L[i].nr == L[i - 1].nr ? P[stp][L[i - 1].p] : i; }
    rep(i,0,n) idx[P[(int)size(P) - 1][i]] = i; }
  int lcp(int x, int y) {
    int res = 0;
    if (x == y) return n - x;
    for (int k = (int)size(P)-1; k >= 0 && x<n && y<n; k--)
      if (P[k][x] == P[k][y])
        x += 1 << k, y += 1 << k, res += 1 << k;
    return res; } };
// vim: cc=60 ts=2 sts=2 sw=2: