Cod sursa(job #1134246)

Utilizator heracleRadu Muntean heracle Data 6 martie 2014 11:41:29
Problema Cel mai lung subsir comun Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 0.76 kb
#include <cstdio>

int a[1030],b[1030];

int c[1030][1030];

int main()
{
    freopen("cmlsc.in","r",stdin);
    freopen("cmlsc.out","w",stdout);
    scanf("%d%d",&a[0],&b[0]);

    for(int i=1;i<=a[0]; i++)
        scanf("%d",&a[i]);

    for(int j=1; j<=b[0]; j++)
        scanf("%d",&b[j]);

    for(int i=1;i<=a[0]; i++)
        for(int j=1;j<=b[0]; j++)
        {
            if(a[i]==b[j])
            {
                c[i][j]=1+c[i-1][j-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[a[0]][b[0]]);

    return 0;
}