Cod sursa(job #1119840)

Utilizator xtreme77Patrick Sava xtreme77 Data 24 februarie 2014 20:19:50
Problema Cel mai lung subsir comun Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 0.83 kb
#include <cstdio>
#define MAX 1030
using namespace std;
short mat[MAX][MAX],na, nb , k;
short a[MAX], b[MAX], sc[MAX];
int maxim(int x, int y)
{
	if(x>y)
		return x;
	else
		return y;
}
int main()
{
	int i, j;
	freopen("cmlsc.in","r",stdin);
	freopen("cmlsc.out","w",stdout);
	scanf("%d%d",&na,&nb);
	for(i=1;i<=na;++i)scanf("%d",a+i);
	for(j=1;j<=nb;++j)scanf("%d",b+j);
	for(i=1; i<=na; i++)
		for(j=1; j<=nb; j++)
			if(a[i]==b[j])
				mat[i][j] = 1 + mat[i-1][j-1];
			else
				mat[i][j] = maxim(mat[i-1][j], mat[i][j-1]);
	i = na; j = nb;
	while(mat[i][j])
	{
		if(a[i] == b[j])
		{
			sc[++k] = a[i];
			i--; j--;
		}
		else
		{
			if(mat[i-1][j]==mat[i][j])
				i--;
			else
				j--;
		}
	}
	printf("%d\n",k);
	for(i=k; i>1; i--)
		printf("%d ",sc[i]);
    printf("%d\n",sc[1]);
    return 0;
}