Cod sursa(job #209201)

Utilizator c_iulyanCretu Iulian c_iulyan Data 21 septembrie 2008 12:42:28
Problema Cel mai lung subsir comun Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 0.78 kb
#include<cstdio>
#define max(a,b) ((a)>(b)?(a):(b))
int n,m,a[1030],b[1030],x[1030][1030],y[1030],k;

void rd()
{
scanf("%d%d",&n,&m);
int i;
for(i=1;i<=n;i++)
	scanf("%d",&a[i]);
for(i=1;i<=m;i++)
	scanf("%d",&b[i]);
}

void pd()
{
for(int i=1;i<=n;i++)
	for(int j=1;j<=m;j++)
		a[i][j]=max(max(a[i][j-1],a[i-1][j]),a[i-1][j-1]+(x[i]==y[j]?1:0));
}

void save(int x)
{
y[++k]=x;
}

void af()
{
printf("%d\n",a[n][m]);
int i=n,j=m;
while(a[i][j]!=0)
	{
	if(a[i-1][j-1]==a[i][j])  i--,j--;
	else if(a[i][j-1]==a[i][j]) j--;
	else if(a[i-1][j]==a[i][j]) i--;
	else save(x[i]),i--,j--;
	}  
for(int l=a[n][m];l;l--)
	printf("%d ",y[l]);
}

int main()
{
freopen("cmlsc.in","r",stdin);
freopen("cmlsc.out","w",stdout);

rd();
pd();
af();

return 0;
}