Cod sursa(job #2774427)

Utilizator BlaugranasEnal Gemaledin Blaugranas Data 11 septembrie 2021 16:50:50
Problema Cel mai lung subsir comun Scor 100
Compilator c-64 Status done
Runda Arhiva educationala Marime 0.63 kb
#include<stdio.h>
#define N 1025
#define M(a,b) ((a)<(b)?b:a)
short n,m,i,j,s[N][N],v[N],x[N],y[N];
int main()
{
    freopen("cmlsc.in","r",stdin),freopen("cmlsc.out","w",stdout),scanf("%d%d",&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)
            s[i][j]=(x[i]==y[j]?1+s[i-1][j-1]:M(s[i][j-1],s[i-1][j]));
    while(n)
        if(x[n]==y[m])
            v[++v[0]]=x[n--],--m;
        else
            s[n-1][m]<s[n][m-1]?--m:--n;
    for(printf("%d\n",v[0]),i=v[0];i;--i)
        printf("%d ",v[i]);
    return 0;
}