[ n^2输出最长公共子序列 ].

如何求出dp路径?或许有所启发。

int f[][];
char a[],b[];
void output(int i ,int j)
{
   if (i == 0 || j == 0) return ;
   else
   {           
             if( a[i-1] == b[j-1]) {output(i-1,j-1);printf("%c",a[i-1]);}
             else if(f[i][j-1] >f[i-1][j]) output(i,j-1);
                   else output(i-1,j);
      }
}
int main()
{
    scanf("%s%s",a,b);
    int n = strlen(a),m = strlen(b);
    for (int i = 1; i <= n;i++)
     for (int j = 1;j <= m;j++)
     if (a[i-1] == b[j-1])f[i][j] = f[i-1][j-] + 1;
     else f[i][j] = max(f[i-1][j], f[i]j-1]);
     output(n,m);
     return 0;
 }