Cod sursa(job #547157)

Utilizator Bogdy4FuNBogdan Ciubotaru Bogdy4FuN Data 5 martie 2011 22:13:47
Problema Cel mai lung subsir comun Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.97 kb
#include <stdio.h>
#define NMax 1024
FILE *f=fopen("cmlsc.in","r");
FILE *g=fopen("cmlsc.out","w");
int i,j,n,m;
int a[NMax],b[NMax],p[NMax][NMax],sol[NMax];


int max(int a,int b) 
{ 
return (a>b)? a:b; 
}

int main(void)
{
    fscanf(f,"%d%d",&n,&m);
    for (i=1;i<=n;i++)
        fscanf(f,"%d",&a[i]);
    for (j=1;j<=m;j++)
        fscanf(f,"%d",&b[j]);
    for (i=1;i<=n;i++)
        for(j=1;j<=m;j++)
        {
                if (a[i]==b[j]) 
					p[i][j]=1+p[i-1][j-1];
                else 
					p[i][j]=max(p[i-1][j],p[i][j-1]); 
        }
	fprintf(g,"%d\n",p[n][m]);
    i=n;
    j=m;
    while (i && j)
    {
        if (a[i]==b[j])
        {
            sol[++sol[0]]=a[i];
            i--;
            j--;
        }
        else
        {
            if (p[i-1][j]>p[i][j-1])
                i--;
            else j--;
        }
    }
    for (i=sol[0];i>=1;i--)
        fprintf(g,"%d ",sol[i]);
	fclose(g);
    return 0;
}