Cod sursa(job #2698651)

Utilizator viorel12Mucenic Ion Viorel viorel12 Data 22 ianuarie 2021 17:17:23
Problema Cel mai lung subsir comun Scor 100
Compilator c-64 Status done
Runda Arhiva educationala Marime 0.74 kb
#include <stdio.h>
#include <stdlib.h>
#define maxim(a,b) ((a>b)?a:b)
#define FOR(i,a,b) for(i=a;i<=b;++i)
#define NMax 1024
int m,n,a[NMax],b[NMax],d[NMax][NMax],sir[NMax],bst;
int main()
{
	int i,j;
    freopen("cmlsc.in","r",stdin);
    freopen("cmlsc.out","w",stdout);
    scanf("%i%i",&m,&n);
    FOR(i,1,m)
		scanf("%i",&a[i]);
	FOR(i,1,n)
			scanf("%i",&b[i]);
    FOR(i,1,m)
	   FOR(j,1,n)
	      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]);
    for(i=m,j=n;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;
	}
	printf("%i\n",bst);
	for(i=bst;i;--i)
		printf("%i ",sir[i]);
    return 0;
}