Cod sursa(job #808977)

Utilizator ZancrowAugustin Zancrow Data 7 noiembrie 2012 19:05:51
Problema Cel mai lung subsir comun Scor 20
Compilator c Status done
Runda Arhiva educationala Marime 0.79 kb
#include<stdio.h>
#define nx 1025
int a[nx],b[nx];
int c[nx][nx];
int max(int x, int y){
return ((x>=y)?x:y);
}

int main(){
int j,i,n,m,p;
        FILE*f=fopen("cmlsc.in","r");
        fscanf(f,"%d %d\n",&n,&m);
        for(i=1;i<=n;i++)fscanf(f,"%d",&a[i]);
        for(i=1;i<=m;i++)fscanf(f,"%d",&b[i]);
        for(i=0;i<=n;i++) c[i][0]=0;
        for(i=0;i<=m;i++) c[0][i]=0;

        for(i=1;i<=n;i++)
          for(j=1;j<=m;j++) if(a[i]==b[j]) c[i][j]=c[i-1][j-1]+1;
                             else c[i][j]=max(c[i][j-1],c[i-1][j]);
         FILE*h=fopen("cmlsc.out","w");
         fprintf(h,"%d\n",c[n][m]);
         p=1;
         for(i=1;i<=n;i++) if(p<=c[n][m])
          for(j=1;j<=m;j++) if(c[i][j]==p) {fprintf(h,"%d ",a[i]); p++;}
fclose(h);
fclose(f);
return 0;
}