Cod sursa(job #2287709)

Utilizator BlaugranasEnal Gemaledin Blaugranas Data 22 noiembrie 2018 13:00:41
Problema Cel mai lung subsir comun Scor 30
Compilator c-64 Status done
Runda Arhiva educationala Marime 0.61 kb
#include<stdio.h>
#define N 1025
unsigned char v[N],s[N][N],x[N],y[N],i,j,n,m;
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]:(s[i][j-1]<s[i-1][j]?s[i-1][j]:s[i][j-1]));
    while(n)
        if(x[n]==y[m])
            v[++v[0]]=x[n],n--,m--;
        else
            s[n-1][m]<s[n][m-1]?m--:n--;
    printf("%d\n",v[0]);
    for(i=v[0];i;i--)
        printf("%d ",v[i]);
}