Cod sursa(job #720353)

Utilizator hiticas_abelhiticasabel hiticas_abel Data 22 martie 2012 16:37:37
Problema Cel mai lung subsir comun Scor 30
Compilator cpp Status done
Runda Arhiva educationala Marime 0.81 kb
#include<stdio.h>
using namespace std;
int a[100],b[100], matrice[100][100],elem[100];
int n,m;

void afis(int i,int j)
{
	if(i>0&&j>0)
	if (a[i]==b[j])
	{afis(i-1,j-1);
	printf("%d ",a[i]);
	}
	else
		if (matrice[i-1][j]>matrice[i][j-1])
			afis(i-1,j);
			else afis(i,j-1);

}
int max(int a,int b)
{
	if (a>b) return a;
	return  b;
}
int main()
{
	int i,j;
	freopen ("cmlsc.in","r",stdin);
	freopen ("cmlsc.out","w",stdout);
	scanf("%d %d",&n,&m);
	
	for(i=1;i<=n;i++)
	 scanf("%d ",&a[i]);
	for(j=1;j<=m;j++)
	  scanf("%d ",&b[j]);
	for(i=1;i<=n;i++)
		for(j=1;j<=m;j++)
			if(a[i]==b[j])
			   	matrice[i][j]=matrice[i-1][j-1]+1;
				else
					matrice[i][j]=max(matrice[i-1][j],matrice[i][j-1]);
				
			printf("%d\n",matrice[n][m]);
			
			afis(n,m);		 
			return 0;
	
	

}