Cod sursa(job #148463)

Utilizator hadesgamesTache Alexandru hadesgames Data 4 martie 2008 12:58:03
Problema Cel mai lung subsir comun Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.68 kb
#include <stdio.h>
int n,m,a[1050],b[1050],d[1050][1050],sir[1050],nr;
int i,j;
int main()
{

	FILE *in,*out;

	in=fopen("cmlsc.in","r");
	out=fopen("cmlsc.out","w");
	fscanf(in,"%d%d\n",&m,&n);	
	for(i=1;i<=m;i++)
		fscanf(in,"%d",&a[i]);
	for(i=1;i<=n;i++)
	fscanf(in,"%d",&b[i]);
	for(i=1;i<=m;i++)
		for(j=1;j<=n;j++)
			if(a[i]==b[j])
				d[i][j]=1+d[i-1][j-1];
			else
				if (d[i-1][j]>d[i][j-1])
					d[i][j]=d[i-1][j];
				else
					d[i][j]=d[i][j-1];
	for(i=m,j=n;i;)
	if(a[i]==b[j])
	sir[++nr]=a[i],i--,j--;
	else
		if(d[i-1][j]<d[i][j-1])
			j--;
	else
		i--;
	fprintf(out,"%d\n",nr);
	for(i=nr;i>=1;i--)
	fprintf(out,"%d ",sir[i]);
	fclose(in);
	fclose(out);
	return 0;
}