Cod sursa(job #594425)

Utilizator Alexandru13Dumitraiche Marius-Alexandru Alexandru13 Data 7 iunie 2011 17:43:40
Problema Cel mai lung subsir comun Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 0.59 kb
#include<fstream.h>
#define max(a,b) ((a > b) ? (a) : (b))
ifstream f("cmlsc.in");
ofstream g("cmlsc.out");
int a[1025],b[1025],d[1025][1025],n,m,sir[1025],k=0;
int main()
{
	int i,j;
	f>>m>>n;
	for(i=1;i<=m;i++)
		f>>a[i];
	for(i=1;i<=n;i++)
		f>>b[i];
	for(i=1;i<=m;i++)
		for(j=1;j<=n;j++)
			if(a[i]==b[i])
				d[i][j]=1+d[i-1][j-1];
			else
				d[i][j]=max(d[i-1][j],d[i][j-1]);
	for(i=m,j=n; i; )
		if(a[i]==b[j])
			sir[++k]=a[i],--i,--j;
		else
			if(d[i-1][j] < d[i][j-1])
				--j;
			else
				--i;
	g<<k<<"\n";
	for(i=k; i;--i)
		g<<sir[i]<<" ";
	return 0;
}