for (int i = 1; i <= n; ++i) { for (int j = 1; j <= m; ++j) { if (a[i] == b[j]) { f[i][j] = f[i-1][j-1] + 1; } else { f[i][j] = 0; } } }
两串前缀最长后缀
原文：http://www.cnblogs.com/tun117/p/5500094.html
