Cod sursa(job #1118444)

Utilizator Juve45UAIC Alexandru Ionita Juve45 Data 24 februarie 2014 11:08:11
Problema Cel mai lung subsir comun Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 0.66 kb
#include <cstdio>
#include <vector>

#define dmax 1025

using namespace std;

int a[dmax], b[dmax], c[dmax][dmax], n, m;

void read()
{
    freopen("cmlsc.in", "r", stdin);
    freopen("cmlsc.out", "w", stdout);

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

}

int main()
{

    read();
    for(int i=1; i<=n; i++)
        for(int j=1; j<=m; j++)
        {
            if(a[i]==b[j])
                c[i][j]=c[i-1][j-1]+1;
            else
            c[i][j]=max(c[i-1][j], c[i][j-1]);
        }

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

    return 0;
}