Following steps build LCSuff [ m + 1 ] [ n + 1 ] in bottom up fashion .
for ( int i = 0 ; i <= m ; i ++ ) { for ( int j = 0 ; j <= n ; j ++ ) { if ( i == 0 j == 0 ) LCSuff [ i , j ] = 0 ; else if ( X [ i - 1 ] == Y [ j - 1 ] ) { LCSuff [ i , j ] = LCSuff [ i - 1 , j - 1 ] + 1 ; if ( len < LCSuff [ i , j ] ) { len = LCSuff [ i , j ] ; row = i ; col = j ; } } else LCSuff [ i , j ] = 0 ; } }