### rajon_aust's blog

By rajon_aust, history, 5 years ago, Today I solved the problem . Link : http://lightoj.com/volume_showproblem.php?problem=1157

I have a question . If the problem is modified and say to find the number of distinct common sub-sequences of n ( 0<=n<=1000 ) length than is it possible to come up a solution ?

let A = "abba" ans B = "abba" , here LCS between A and B is 4 . So number of distinct LCS between A and B is 1 . But if said find the number of distinct common sub-sequences of 3 length than answer will be 3 ( "abb" , "aba" , "bba" ) . lcs,
By rajon_aust, history, 5 years ago, I tried to solve the problem last 3 days . I didn't understand where my algorithm not work ! I use strongly connected component and dynamic programming . Please provide some suggestion that how can I solve the problem . Thanks in advance .

By rajon_aust, history, 5 years ago, I don't find any solution idea for this problem . I am totally stuck in this problem . If anyone solve the problem , please give me the idea for this problem . Thanks in advance !

http://www.spoj.com/problems/HIGH/

By rajon_aust, 5 years ago, 