Cod sursa(job #431401)

Utilizator NemultumituMatei Ionita Nemultumitu Data 31 martie 2010 22:46:52
Problema Cel mai lung subsir comun Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.89 kb
#include <cstdio>
int a[1030],b[1030],sir[1030];
int n,m;
int lung[1030][1030];

int max(int a,int b)
{
	if (a>b)
		return a;
	return b;
}

void citire()
{
	freopen ("cmlsc.in","r",stdin);
	freopen ("cmlsc.out","w",stdout);
	int i;
	scanf("%d%d",&n,&m);
	for (i=1;i<=n;++i)
		scanf("%d",&a[i]);
	for (i=1;i<=m;++i)
		scanf("%d",&b[i]);
}

void dinamica()
{
	for (int i=1;i<=n;++i)
		for (int j=1;j<=m;++j)
			if (a[i]==b[j])
				lung[i][j]=1+lung[i-1][j-1];
			else
				lung[i][j]=max(lung[i-1][j],lung[i][j-1]);
}

void scrie()
{
	printf("%d\n",lung[n][m]);
	int k=0,i=n,j=m;
	while (i&&j)
	{
		if (a[i]==b[j])
		{
			sir[++k]=a[i];
			--i;
			--j;
		}
		else
			if (lung[i-1][j]>lung[i][j-1])
				--i;
			else
				--j;
	}
	for (int i=k;i;--i)
		printf("%d ",sir[i]);
	printf("\n");
}

int main()
{
	citire();
	dinamica();
	scrie();
	return 0;
}