Cod sursa(job #1219552)

Utilizator codi22FMI Condrea Florin codi22 Data 14 august 2014 15:52:47
Problema Cel mai lung subsir comun Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 0.46 kb
#include <iostream>
#include <fstream>
using namespace std;
int m,n,V1[1030],V2[1030],i,j,M[1030][1030];
ifstream f("cmlsc.in");
ofstream g("cmlsc.out");
int main()
{
    f>>n>>m;
    for (i=1;i<=n;i++)
        f>>V1[i];
    for (i=1;i<=m;i++)
        f>>V2[i];
    for (i=1;i<=n;i++)
        for (j=1;j<=m;j++)
        {
            if (V1[i]==V2[j]) M[i][j]=M[i-1][j-1]+1;
            else M[i][j]=max(M[i-1][j],M[i][j-1]);
        }
    g<<M[n][m];
}