Cod sursa(job #183416)

Utilizator A-TeamKovago L si Albert I A-Team Data 22 aprilie 2008 08:26:07
Problema Cel mai lung subsir comun Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 0.69 kb
#include<stdio.h>
#define maxim(a,b) ((a>b) ? a:b)
FILE *in=fopen("cmlsc.in","r"),*out=fopen("cmlsc.out","w");
int m,n,mat[1025][1025],v[1025],v2[1025],i,j,bst,sir[1025];
int main()
{
	fscanf(in,"%d %d",&m,&n);
	for(i=1;i<=m;i++)
		fscanf(in,"%d",&v[i]);
	for(i=1;i<=n;i++)
		fscanf(in,"%d",&v2[i]);
	for(i=1;i<=m;i++)
		for(j=1;j<=n;j++)
		{
			if(v[i]==v[j])
				mat[i][j]=mat[i-1][j-1]+1;
			else
				mat[i][j]=maxim(mat[i-1][j],mat[i][j-1]);
		}
	i=m;
	j=n;
	while(i)
	{
		if(v[i]==v2[j])
			{sir[++bst]=v[i];i--;j--;}
		else if(mat[i-1][j]<mat[i][j-1])
			j--;
		else
			i--;
	}
	fprintf(out,"%d\n",bst);
	for(i=bst;i>0;i--)
		fprintf(out,"%d ",sir[i]);
	return 0;
}