Cod sursa(job #700027)

Utilizator darle.gheorgheDarle Gheorghe darle.gheorghe Data 29 februarie 2012 22:57:03
Problema Cel mai lung subsir comun Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.78 kb
#include<stdio.h>
FILE *fin,*fout;
int n,m;
int a[1024],b[1024];
int c[1024],d[1024][1024];

int afisare(int i,int j)
{
if(d[i][j]!=0)
	{
		if(a[i]==b[j])
		{
			afisare(i-1,j-1);
			fprintf(fout,"%d ",a[i]);
		}
		else
			if(d[i][j]==d[i-1][j])
				afisare(i-1,j);
			else
				afisare(i,j-1);
	}
}

main()
{
int i,j;
fin = fopen("cmlsc.in","r");
fout = fopen("cmlsc.out","w");
fscanf(fin,"%d%d",&n,&m);
for(i=1;i<=n;i++)
	fscanf(fin,"%d",&a[i]);
for(i=1;i<=m;i++)
	fscanf(fin,"%d",&b[i]);
for(i=1;i<=n;i++)
	for(j=1;j<=m;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];
		}
fprintf(fout,"%d\n",d[n][m]);
afisare(n,m);
fclose(fin);
fclose(fout);
}