Cod sursa(job #2347747)

Utilizator BlaugranasEnal Gemaledin Blaugranas Data 19 februarie 2019 08:14:23
Problema Cel mai lung subsir comun Scor 0
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.94 kb
#include<cstdio>
#define N 1025
#define M(a,b) (a<b?b:a)
#define L 2000000
unsigned char v[N],s[N][N],x[N],y[N];
int n,m,i=-1,j,k,l;
char p[L];
int A()
{
  	int s=0;
  	for(i++;p[i]>='0';i++)
  		s=s*10+p[i]-48;
  	return s;
}
void S(int b,char c)
{
	if(b>99)
        p[k++]=b/100,p[k++]=(b/10)%10,p[k++]=b%10;
    else if(b>9)
        p[k++]=b/10,p[k++]=b%10;
    else
        p[k++]=b;
	p[k++]=c;
}
int main()
{
    freopen("cmlsc.in","r",stdin),freopen("cmlsc.out","w",stdout),fread(p,1,L,stdin),n=A(),m=A();
    for(j=1;j<=n;j++)
        x[j]=A();
    for(j=1;j<=m;j++)
        y[j]=A();
    for(l=1;l<=n;l++)
        for(j=1;j<=m;j++)
            s[l][j]=(x[l]==y[j]?1+s[l-1][j-1]:M(s[l][j-1],s[l-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--;
    S(v[0],'\n');
    for(i=v[0];i;i--)
    	S(v[i],' ');
    fwrite(p,1,k,stdout);
}