Cod sursa(job #1154493)

Utilizator gbibBacotiu Gabi gbib Data 26 martie 2014 10:47:55
Problema Cel mai lung subsir comun Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 0.76 kb

#include <stdio.h>

using namespace std;
int a[1025][1025];
int li[1025];
int ci[1025];
int subs[1025];
int main()
{int m,n,i,j,k=0;
freopen("cmlsc.in", "r", stdin);
freopen("cmlsc.out", "w", stdout);
scanf("%d %d", &m, &n);
for(i=1;i<=m;i++)
    scanf("%d", &li[i]);
for(i=1;i<=n;i++)
     scanf("%d", &ci[i]);
for(i=1;i<=m;i++)
for(j=1;j<=n;j++)
{if(li[i]==ci[j]) a[i][j]=a[i-1][j-1]+1;
else {if(a[i-1][j]>a[i][j-1]) a[i][j]=a[i-1][j];
      if(a[i-1][j]<a[i][j-1]) a[i][j]=a[i][j-1];
     }}
i=m;
j=n;
while(i>0)
{
    if(li[i]==ci[j]) {subs[++k]=ci[j];
    j--;
    i--;}
   else{if(a[i-1][j]<a[i][j-1]) j--;
    if(a[i-1][j]>a[i][j-1]) i--;}
}
printf("%d\n", k);
    for (i = k; i; --i)
        printf("%d ", subs[i]);
    return 0;
}