Cod sursa(job #1101421)

Utilizator corina1802Adam Corina corina1802 Data 8 februarie 2014 14:26:34
Problema Cel mai lung subsir comun Scor 20
Compilator cpp Status done
Runda Arhiva educationala Marime 0.69 kb
#include<fstream>
using namespace std;
int x[1100][1100];
ifstream fin("cmlsc.in");
ofstream fout("cmlsc.out");
int main()
{int a[1100],b[1100],n,m,c[1100],pas=1,i,j,max=0;
fin>>n;
fin>>m;
for(i=1;i<=n;i++)
    fin>>a[i];
for(i=1;i<=m;i++)
    fin>>b[i];
for(i=1;i<=n;i++)
    for(j=1;j<=m;j++)
        if(a[i]==b[j])
            {x[i][j]=x[i-1][j-1]+1;
			if(max<x[i][j])
				{max=x[i][j];
				c[pas]=a[i];
				pas++;
				}
            }
        else
            if(x[i][j-1]>x[i-1][j])
                x[i][j]=x[i][j-1];
            else
                x[i][j]=x[i-1][j];
fout<<x[n][m]<<endl;
for(i=1;i<pas;i++)
    fout<<c[i]<<' ';
fin.close();
fout.close();
return 0;
}