Cod sursa(job #373045)

Utilizator taseTanase Alexandru tase Data 12 decembrie 2009 15:11:40
Problema Cel mai lung subsir comun Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.7 kb
#include<stdio.h>
int m,n,i,j,v[1030][1030],a[1030],b[1030],k,l,p=0;
inline int max(int x,int y)
{
	if(x>y) return x;
	return y;
}
void scrie(int i,int j)
{
	if(i==0||j==0) return;
	if(a[i]==b[j])
	{
		scrie(i-1,j-1);
		printf("%d ",a[i]);
	}
	else 
		if(v[i-1][j]>v[i][j-1])
			scrie(i-1,j);
		else scrie(i,j-1);
}
int main()
{
	freopen("cmlsc.in","r",stdin);
	freopen("cmlsc.out","w",stdout);
	scanf("%d%d",&m,&n);
	for(i=1;i<=m;++i)
		scanf("%d",&a[i]);
	for(i=1;i<=n;++i)
		scanf("%d",&b[i]);
	for(i=1;i<=m;++i)
	{
		for(j=1;j<=n;++j)
			if(a[i]==b[j])
					v[i][j]=v[i-1][j-1]+1;
			else v[i][j]=max(v[i-1][j],v[i][j-1]);
	}
	printf("%d\n",v[m][n]);
	scrie(m,n);
	return 0;
}