Cod sursa(job #503115)

Utilizator BlaugranasEnal Gemaledin Blaugranas Data 21 noiembrie 2010 15:34:41
Problema Cel mai lung subsir comun Scor 30
Compilator cpp Status done
Runda Arhiva educationala Marime 1.36 kb
#include<cstdio>
int v[1025],d,s[1025][1025],i,j,n,m,x[1025],y[1025],k,e,z[1025][1025];
int main()
{freopen("cmlsc.in","rt",stdin);
freopen("cmlsc.out","wt",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=0;i<=n;i++)
      s[i][0]=0;
for(j=0;j<=m;j++)
      s[0][j]=0;
for(i=1;i<=n;i++)
      {for(j=1;j<=m;j++)
             {s[i][j]=0;
             z[i][j]=-1;
             if(x[i]==y[j])
                      s[i][j]=s[i-1][j-1]+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];
             if(s[i][j]>s[i+1][j-1]&&i<n&&j>1)
                      z[i][j]=x[i];}}
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&&z[i][j]!=-1)
              {v[k]=z[i][j];
              d=j;
              e=i;}}
for(i=k-1;i>=1;i--)
       {while(s[n][d-1]==s[1][d-1])
              d--;
       for(j=1;j<e;j++)
       if(i==s[j][d-1]&&z[j][d-1]!=-1)
              {v[i]=z[j][d-1];
              d--;
              e=j;
              break;}}
for(i=1;i<=k;i++)
       printf("%d ",v[i]);              
printf("\n");
fclose(stdin);
fclose(stdout);
return 0;}