Cod sursa(job #497019)

Utilizator Mastertrap21Danceanu Madalin Mastertrap21 Data 1 noiembrie 2010 12:19:40
Problema Cel mai lung subsir comun Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 0.95 kb
#include<stdio.h>
using namespace std;
int n, m, a[1024], b[1024], d[1024][1024], sir[1024], nr=0;


	FILE* in = fopen("cmlsc.in", "r");
	FILE* out = fopen("cmlsc.out", "w");


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

int maxim(int a, int b)
{
	if(a>=b) return a;
	else return b;
}

void rezolva()
{
	for(int i=1;i<=n;i++)
		for(int j=1;j<=m;j++)
		{
			if(a[i]==b[j]) d[i][j]=d[i-1][j-1]+1;
			else d[i][j]=maxim(d[i-1][j], d[i][j-1]);
		}
}

void rezsir()
{
	for(int i=n, j=m; i && j; )
    {
      if(a[i] == b[j])
      {
          sir[++nr] = a[i];
          --i; --j;
      }
      else if(d[i][j-1] < d[i-1][j])
        --i;
      else
        --j;
	}
}

int main()
{
	citire();
	rezolva();
	rezsir();
	fprintf(out, "%d\n", d[n][m]); 
	for(int i=nr;i<=1;i--) fprintf(out, "%d ", sir[i]); 
	return 0;
}