Cod sursa(job #755524)

Utilizator dragosd2000Dumitrache Dragos dragosd2000 Data 5 iunie 2012 23:37:08
Problema Cel mai lung subsir comun Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.67 kb
#include<fstream>

using namespace std;

ifstream fin("cmlsc.in");
ofstream fout("cmlsc.out");

int m,n,i,j;
int a[1030],b[1030],t[1030],c[1030][1030],k; 

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] = c[i-1][j-1]+1;
			else
				if(c[i-1][j]>c[i][j-1])
					c[i][j] = c[i-1][j];
				else
					c[i][j] = c[i][j-1];
	fout<<c[m][n]<<'\n';
	for(i=m, j=n; i;)
		if(a[i] == b[j])
		{
			t[++k] = a[i];
			--i;
			--j;
		}
		else
			if(c[i-1][j]<c[i][j-1])
				--j;
			else
				--i;
	
	for(i=k;i>=1;i--)
		fout<<t[i]<<' ';
	return 0;
}