Cod sursa(job #1092423)

Utilizator StefaanStefanescu Stefan Stefaan Data 27 ianuarie 2014 00:02:20
Problema Cel mai lung subsir comun Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.98 kb
#include<fstream>
using namespace std;
ifstream f("cmlsc.in");
ofstream g("cmlsc.out");
int x[10050],y[10050],n,m,a[10050][10050];
void citire()
{
    int i;
    f>>n>>m;
    for(i=1;i<=n;i++)
        f>>x[i];
    for(i=1;i<=m;i++)
        f>>y[i];
}
void sub()
{
    int i,j;
    for(i=1;i<=n;i++)
    {
        for(j=1;j<=m;j++)
        {
            if(x[i]==y[j])
                a[i][j]=a[i-1][j-1]+1;
            else
            {
                a[i][j]=max(a[i-1][j],a[i][j-1]);
            }
        }
    }
}
void afis()
{
    int i,j,k=0,v[1050];
    i=n; j=m;
    g<<a[n][m]<<"\n";
    while(i!=0 && j!=0)
    {
        if(x[i]==y[j])
        {   v[++k]=x[i];
            i--;
            j--;
        }
        else
        {
            if(a[i][j]==a[i][j-1])
                j--;
            else i--;
        }
    }
    for(i=k;i>=1;i--)
        g<<v[i]<<" ";
}
int main()
{
    citire();
    sub();
    afis();
    return 0;
}