Cod sursa(job #256655)

Utilizator luk17Luca Bogdan luk17 Data 11 februarie 2009 23:22:26
Problema Cel mai lung subsir comun Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 1 kb
#include<stdio.h>
#define NMAX 125

int a[NMAX][NMAX],b[NMAX],c[NMAX],n,m,sol[NMAX],lung=0;;
int maxim(int a,int b,int c)
{
	if(a>b)
		if(a>c)return a;
		else
			return c;
	else if(b>c)return b;
		else
			return c;
}
void afisare(int i,int j)
{
	if(a[i][j]!=0)
		afisare(i-1,j-1);
	if(a[i][j])
	printf("%d ",b[i]);
}
int main()
{int i,j,pozi,pozj,max=0;;
freopen("cmlsc.in","r",stdin);
freopen("cmlsc.out","w",stdout);
scanf("%d%d",&n,&m);
	  for(i=1;i<=n;i++)
		  scanf("%d",&b[i]);
	  for(i=1;i<=m;i++)
		  scanf("%d",&c[i]);
		
	for(i=1;i<=n;i++)	
		for(j=1;j<=m;j++)
			if(b[i]==c[j])
			{
				a[i][j]=1+a[i-1][j-1];
				sol[++lung]=b[i];			
				if(a[i][j]>max)
				{
				max=a[i][j];
				pozi=i;
				pozj=j;
				}				
			}
			else a[i][j]=maxim(a[i-1][j-1],a[i-1][j],a[i][j-1]);
		for(i=1;i<=n;i++)
		{
			for(j=1;j<=m;j++)
				printf("%d ",a[i][j]);
			printf("\n");
}

	printf("%d\n",a[pozi][pozj]);
	for(i=1;i<=lung;i++)
		printf("%d ",sol[i]);
return 0;}