Cod sursa(job #189703)

Utilizator jupanubv92Popescu Marius jupanubv92 Data 17 mai 2008 11:17:03
Problema Cel mai lung subsir comun Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 0.76 kb
#include<stdio.h>
#define NMax 1025
#define maxim(a, b) ((a > b) ? a : b)

int n,m,a[NMax],b[NMax];
int d[NMax][NMax];

void citire()
{
 scanf("%d %d",&n,&m);
 for(int i=1;i<=n;i++)
   scanf("%d",&a[i]);
 for(int j=1;j<=m;j++)
   scanf("%d",&b[j]);

}

void solve()
{
 for(int i=1;i<=n;i++)
  for(int j=1;j<=m;j++)
    if(a[i]==b[j])
      d[i][j]=1+d[i-1][j-1];
     else d[i][j]=maxim(d[i-1][j],d[i][j-1]);

 int bst=0,j,sir[NMax];
 for(i=n,j=m;i;)
    if(a[i]==b[j])
       sir[++bst]=a[i],--i,--j;
     else if(d[i-1][j]<d[i][j-1])
	     --j;
	    else --i;

 for(i=bst;i>=1;i--)
   printf("%d ",sir[i]);



}

int main()
{
 freopen("cmlsc.in","r",stdin);
 freopen("cmlsc.out","w",stdout);

 citire();
 solve();
 return 0;
}