Cod sursa(job #263090)

Utilizator magda_ursuleanUrsulean Magda magda_ursulean Data 19 februarie 2009 21:52:46
Problema Cel mai lung subsir comun Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 0.63 kb
#include <fstream>
#define NMAX 1025



int m,n,i,max,a[NMAX],b[NMAX],sol[NMAX],poz=1,j,loc,k;

void citire()
{ fin>>m>>n;
  for (int i=1; i<=m; i++) fin>>a[i];
  for (int i=1; i<=n; i++) fin>>b[i];
}

int solutie(int i, int j)
{ if (i==m+1 && j==n+1) return max;
    else if (a[i]==b[j]) { max++; sol[poz]=a[i]; poz++; solutie(i+1, j+1); }
	     else if (j==n) solutie(i+1,1);
		else solutie(i, j+1);


}


int main()
{ ifstream fin("cmlsc.in");
  ofstream fout("cmlsc.out");
  citire();
  fout<<solutie(1,1)<<'\n';
  for (int i=1; i<=max; i++) fout<<sol[i]<<' ';
  fin.close();
  fout.close();
  return 0;

}