Cod sursa(job #1653306)

Utilizator astelescu_97Stelescu Andrei astelescu_97 Data 15 martie 2016 20:53:05
Problema Cel mai lung subsir comun Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 1.31 kb
#include<fstream>
using namespace std;
ifstream fin("cmlsc.in");
ofstream fout("cmlsc.out");
int b[1030],c[1030][1030],a[1030],x[1030],m,n,i,j,k;
char d[1030][1030];
int main()
{
    fin>>m>>n;
    for(i=1;i<=m;i++)
    {
        fin>>a[i];
    }
    for(i=1;i<=n;i++)
    {
        fin>>b[i];
    }
    for(i=1;i<=m;i++)
    for(j=1;j<=n;j++)
    {
        if(a[i]==b[j])
        {
            c[i][j]=1+c[i-1][j-1];
            d[i][j]='\\';
        }
        else
        {
           if(c[i-1][j]>c[i][j-1])
           {
               c[i][j]=c[i-1][j];
               d[i][j]='|';
           }
           else
           {
               c[i][j]=c[i][j-1];
               d[i][j]='-';
           }
        }
    }
    fout<<c[m][n]<<endl;
    i=m;
    j=n;
    k=0;
    while(i>0 && j>0)
    {
        if(a[i]==b[j])
        {
            k++;
            x[k]=a[i];
        }
        if(d[i][j]=='\\')
        {
            i--;
            j--;
        }
        else
        {
            if(d[i][j]=='|')
            {
                i--;
            }
            else
            {
                j--;
            d[i][j]='-';}

        }
    }
    for(i=k;i>=1;i--)
    {
        fout<<x[i]<<" ";
    }
    fout.close();
    fin.close();
    return 0;
}