LCS 데이터 체인 곱셈 코드

#include<cstdio>
using namespace std;
const int n=6;
int p[n+1]={30,35,15,5,10,20,25};
int s[n+1][n+1], m[n+1][n+1];
void separate(int a,int b)
{
    if(a>=b)
        printf("A%d",a);
    else
    {
        printf("(");
        separate(a,s[a][b]);
        printf(")(");
        separate(s[a][b]+1,b);
        printf(")");
    }
}
int main()
{
    for(int len=2;len<=n;++len)
        for(int i=1;i<=n-len+1;++i)
        {
            int j=len+i-1,q;
            m[i][j]=1<<24;
            for(int k=i;k<j;++k)
                if((q=m[i][k]+m[k+1][j]+p[i-1]*p[k]*p[j])<m[i][j])
                    {m[i][j]=q;s[i][j]=k;}
        }
    printf("%d
",m[1][6]);
    separate(1,6);
    return 0;
}

#include<iostream>
using namespace std;
const int n=22,m=17,_l=1,_u=2,_lu=3;
const char a[50]="@fqwuecrtkz csbbdn";//start from a[1]
const char b[50]="@yyfniuiohcpkg cppsdmmn";
int len[m+1][n+1];
int pre[m+1][n+1];
void lcs(int x,int y)
{
    if(!x||!y)return;
    if(pre[x][y]==_lu)
    {
        lcs(x-1,y-1);
        cout<<a[x];
    }
    else if(pre[x][y]==_l)
        lcs(x,y-1);
    else
        lcs(x-1,y);
}
int main()
{
    for(int i=1;i<=m;++i)
        for(int j=1;j<=n;++j)
        {
            if(a[i]==b[j])
            {
                pre[i][j]=_lu;
                len[i][j]=len[i-1][j-1]+1;
            }
            else if(len[i-1][j]<len[i][j-1])
            {
                pre[i][j]=_l;
                len[i][j]=len[i][j-1];
            }
            else
            {
                pre[i][j]=_u;
                len[i][j]=len[i-1][j];
            }
        }
    cout<<"length of lcs is "<<len[m][n]<<":";
    lcs(m,n);
    return 0;
}