int lcp(int a,int b) { int t; a=rank[a];b=rank[b]; if(a>b) {t=a;a=b;b=t;} return(height[askRMQ(a+1,b)]); }
int lcp(int a,int b) { a=rank[a]; b=rank[b]; if(a>b) swap(a,b); return height[askRMQ(a+1,b)]; }