Competitive Programing Problem Solutions/String/Suffix Array O(n)-sj.cpp
int lcp_(int i,int j)
{
    if(i==j) return sz-i;
    int l=ra[i];
    int r=ra[j];
    if(l>r) swap(l,r);
    return get(l,r-1);
}
///lcp of suffix starting from i and j

lcp of suffix starting from i and j
lcp of suffix starting from i and j
int lcp_(int i,int j)
{
    if(i==j) return sz-i;
    int l=ra[i];
    int r=ra[j];
    if(l>r) swap(l,r);
    return get(l,r-1);
}
int lcp_ ( int i , int j ) { if ( i == j ) return sz - i ; int l = ra [ i ] ; int r = ra [ j ] ; if ( l > r ) swap ( l , r ) ; return get ( l , r - 1 ) ; }
lcp of suffix starting from i and j
lcp of suffix starting from i and j