Cod sursa(job #689723)

Utilizator mihai_bogdaannMihai Bogdan mihai_bogdaann Data 24 februarie 2012 19:23:34
Problema Cel mai lung subsir comun Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.76 kb
#include<stdio.h>
#define NMAX 1025

FILE *fin = fopen("cmlsc.in","r");
FILE *fout = fopen("cmlsc.out","w");

int c[NMAX][NMAX],n,m,i,j,max,a[NMAX],b[NMAX],sol[NMAX];

int MAX(int a, int b)
{return a>b?a:b;}

int main()
{
	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])
				c[i][j] = c[i-1][j-1]+1;
			else
				c[i][j] = MAX(c[i-1][j],c[i][j-1]);
		}
	}
	int lg=0;
	for(i=n,j=m;i>=1 && j>=1;)
			if(a[i] == b[j])
				sol[++lg]=a[i],i--,j--;
			else
				if(c[i-1][j]<c[i][j-1])
					j--;
				else
					i--;
	fprintf(fout,"%d\n",c[n][m]);
	for(i=lg;i>=1;i--)
		fprintf(fout,"%d ",sol[i]);
	return 0;
}