Cod sursa(job #174275)

Utilizator CosminStirbuStirbu Cosmin CosminStirbu Data 8 aprilie 2008 18:19:36
Problema Cel mai lung subsir comun Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 0.76 kb
#include<stdio.h>

int n,m,a[1024],b[1024],x[1024][1024],s[1024],l;

void citire()
{
 int i;
 FILE*f=fopen("cmlsc.in","r");
 fscanf(f,"%d %d",&m,&n);
 for(i=1;i<=m;i++)
	fscanf(f,"%d",&a[i]);
 for(i=1;i<=n;i++)
	fscanf(f,"%d",&b[i]);
 fclose(f);
}

void rezolv ()
 { int i,j;
   for(i=1;i<=m;i++)
    for(j=1;j<=n;j++)
      if(a[i]==b[j]) x[i][j]=x[i-1][j-1]+1;
        else { x[i][j]=x[i][j-1];
  	       if (x[i-1][j]>x[i][j-1]) x[i][j]=x[i-1][j]; }
   i=m;
   j=n;
   while(i&&j)
	if(a[i]==b[j]){ s[++l]=a[i];
			i--;
			j--;}
	else if(x[i][j-1]>x[i-1][j]) j--;
	     else i--;

   }
int main()
{int i;
 FILE*g=fopen("cmlsc.out","w");
 citire();
 fprintf(g,"%d\n",l);
 for(i=l;i>=1;i--)
	fprintf(g,"%d ",s[i]);
 fclose(g);
 return 0;
}