c*****z
发帖数: 182 | 1 is there a lcs implementation in boost? i didn't find it.
is there any link to a stable, fast implementation? the core
part is it should have a o(n) suffix tree building function, thanks! | P********e
发帖数: 2610 | 2 自己写一个DP应该也不会用很久
【在 c*****z 的大作中提到】
: is there a lcs implementation in boost? i didn't find it.
: is there any link to a stable, fast implementation? the core
: part is it should have a o(n) suffix tree building function, thanks!
| c*****z
发帖数: 182 | 3 as far as i know dp's complexity is o(mn) that is not what i want...
【在 P********e 的大作中提到】
: 自己写一个DP应该也不会用很久
|
|
