Cod sursa(job #267989)

Utilizator Alexa_ioana_14Antoche Ioana Alexandra Alexa_ioana_14 Data 28 februarie 2009 16:51:50
Problema Cel mai lung subsir comun Scor 20
Compilator cpp Status done
Runda Arhiva educationala Marime 0.73 kb
#include<stdio.h>
#define N 1026
int a[N][N],v1[N],v2[N],n,m,v[N],nr;
void citire()
{
	freopen("cmlsc.in","r",stdin);
	freopen("cmlsc.out","w",stdout);
	scanf("%d%d",&n,&m);
	for (int i=1; i<=n; ++i) scanf("%d",&v1[i]);
	for (int i=1; i<=m; ++i) scanf("%d",&v2[i]);
}
void matrice()
{
	for (int i=1; i<=n; ++i)
	{
		for (int j=1; j<=m; ++j)
			if (v1[i]==v2[j])
				a[i][j]=a[i-1][j-1]+1;
			else
				if (a[i-1][j]>a[i][j-1])
					a[i][j]=a[i-1][j];
				else
					a[i][j]=a[i][j-1];
	}
	printf("%d\n",a[n][m]);
}
int c=0;
void subsir()
{
	for(int i=1;i<=n; ++i)
	{
		for(int j=1;j<=m;++j)
			if(a[i][j]!=c){
				printf("%d ",v1[i]);c=a[i][j];}
	}
}
int main()
{
	citire();
	matrice();
	subsir();
	return 0;
}