Cod sursa(job #1484857)

Utilizator DeltaMTP Dragos DeltaM Data 12 septembrie 2015 01:27:52
Problema Cel mai lung subsir comun Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.96 kb
#include<cstdio>
int n,m,i,j,nr,v[1100],x[1100],d[1100][1100],s[1100];
FILE *f,*g;
int maxim(int a,int b){
    if(a>b)
        return a;
    return b;
}
int main(){
    f=fopen("cmlsc.in","r");
    g=fopen("cmlsc.out","w");
    fscanf(f,"%d%d",&n,&m);
    for(i=1;i<=n;i++){
        fscanf(f,"%d",&v[i]);
    }
    for(i=1;i<=m;i++){
        fscanf(f,"%d",&x[i]);
    }
    for(i=1;i<=n;i++){
        for(j=1;j<=m;j++){
            if(v[i]==x[j])
                d[i][j]=d[i-1][j-1]+1;
            else
                d[i][j]=maxim(d[i-1][j],d[i][j-1]);
        }
    }
    fprintf(g,"%d\n",d[n][m]);
    i=n;
    j=m;
    while(i>=1&&j>=1){
        if(v[i]==x[j]){
            s[++nr]=v[i];
            i--;
            j--;
        }
        else if(d[i-1][j]>d[i][j-1])
            i--;
        else
            j--;
    }
    for(i=nr;i>=1;i--){
        fprintf(g,"%d ",s[i]);
    }
    fclose(f);
    fclose(g);
    return 0;
}