Cod sursa(job #353016)

Utilizator O_NealS. Alex O_Neal Data 3 octombrie 2009 21:44:36
Problema Cel mai lung subsir comun Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.87 kb
#include<fstream>
using namespace std;

int c[1025][1025];


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