SPOJPL/LongestCommonSubstring2.cpp
void compute_reverse_sa() {
	for(int i = 0; i <= AN; i++) {
		REVSA[SA[i]] = i;
	}
}
/* Computes the reverse SA index.  REVSA[i] gives the index of the suffix
 * starting a i in the SA array.  In other words, REVSA[i] gives the number of
 * suffixes before the suffix starting at i.  This can be useful in itself but
 * is also used for compute_lcp().
 */
Computes the reverse SA index.  REVSA[i] gives the index of the suffix
starting a i in the SA array.  In other words, REVSA[i] gives the number of
suffixes before the suffix starting at i.  This can be useful in itself but
is also used for compute_lcp().
Computes the reverse SA index . REVSA [ i ] gives the index of the suffix starting a i in the SA array . In other words REVSA [ i ] gives the number of suffixes before the suffix starting at i . This can be useful in itself but is also used for compute_lcp () .
void compute_reverse_sa() {
	for(int i = 0; i <= AN; i++) {
		REVSA[SA[i]] = i;
	}
}
void compute_reverse_sa ( ) { for ( int i = 0 ; i <= AN ; i ++ ) { REVSA [ SA [ i ] ] = i ; } }
Computes the reverse SA index.
Computes the reverse SA index .