Cod sursa(job #152302)

Utilizator QbyxEros Lorand Qbyx Data 9 martie 2008 12:36:20
Problema Cel mai lung subsir comun Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.83 kb
#include <stdio.h>

int a[1025], b[1025], c[1025][1025], r[1025], i, j, n, m, l;

int main()
{
    freopen("cmlsc.in", "rt", stdin);
    freopen("cmlsc.out", "wt", stdout);

    scanf("%d %d", &n, &m);

    for (i = 1; i <= n; ++i) scanf("%d", &a[i]);
    for (i = 1; i <= m; ++i) scanf("%d", &b[i]);

    for (i = 1; i <= n; ++i)
	for (j = 1; j <= m; ++j)
	    if (a[i] == b[j])
		c[i][j] = c[i - 1][j - 1] + 1;
	    else
	      if (c[i - 1][j] > c[i][j - 1])
		  c[i][j] = c[i - 1][j];
	      else c[i][j] = c[i][j - 1];

    printf("%d\n", c[n][m]);

    i = n; j = m;

    while (i && j)
    {
	if (a[i] == b[j])
	{
	    r[++l] = a[i];
	    --i;
	    --j;
	}
	else
	    if (c[i - 1][j] > c[i][j - 1])
		--i;
	    else
		--j;
    }

    for (i = l; i >= 1; --i)
	printf("%d ", r[i]);

    return(0);
}