Cod sursa(job #503075)

Utilizator BlaugranasEnal Gemaledin Blaugranas Data 21 noiembrie 2010 13:06:25
Problema Cel mai lung subsir comun Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 1.14 kb
#include<cstdio>
#define NR 1025
int q,c[NR],v[NR],d,r,s[NR][NR],i,j,n,m,x[NR],y[NR],k,max,t=1,p=0,g[NR],z[NR][NR];
int main()
{freopen("cmlsc.in","r",stdin);
freopen("cmlsc.out","w",stdout);
scanf("%d %d\n",&n,&m);
for(i=1;i<=n;i++)
      scanf("%d",&x[i]);
for(i=1;i<=m;i++)
      scanf("%d",&y[i]);
for(i=1;i<=n;i++)
      {for(j=1;j<=m;j++)
             {z[i][j]=0;
             s[i][j]=0;
             if(x[i]==y[j])
                      {s[i][j]=s[i-1][j-1]+1;
                      z[i][j]=1;}
             else
                      s[i][j]=s[i-1][j-1];
             if(s[i][j]<s[i-1][j])
                      s[i][j]=s[i-1][j];
             if(s[i][j]<s[i][j-1])
                      s[i][j]=s[i][j-1];}}
printf("%d\n",s[n][m]);
k=s[n][m];
for(i=n;i>=1;i--)
       {for(j=m;j>=1;j--)
       if(s[i][j]==k)
              {v[k]=y[j];
              d=j;}}
for(i=k-1;i>=1;i--)
       {for(j=1;j<=n;j++)
       if(i==s[j][d-1])
              {v[i]=y[d-1];
              d--;
              break;}}
for(i=1;i<=k;i++)
       printf("%d ",v[i]);              
printf("\n");
fclose(stdin);
fclose(stdout);
return 0;}