后缀数组应用5: 求两个不同字串串的最长公共子串
摘要:
求两个不同字串串的最长公共子串依然是将两个字串串拼接在一起。。然后求sa,height数组,最后枚举height值。。View Code #include<stdio.h>#include<stdlib.h>#include<string.h>#include<iostream>#include<vector>#include<string>#include<math.h>#include<map>#include<set>#include<algorithm>using n 阅读全文
posted @ 2012-09-26 16:32 more think, more gains 阅读(175) 评论(0) 推荐(0) 编辑