Cod sursa(job #1950722)

Utilizator amaliarebAmalia Rebegea amaliareb Data 3 aprilie 2017 11:19:12
Problema Cel mai lung subsir comun Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 0.49 kb
#include <iostream>
#include <fstream>

using namespace std;
ifstream f("cmlsc.in");
ofstream g("cmlsc.out");
int n,m,i,j,x[1500],v[1500],mat[1026][1026],val;
int main()
{
    f>>n>>m;
    for(i=1;i<=n;i++) f>>v[i];
    for(i=1;i<=m;i++) f>>x[i];
    for(i=1;i<=n;i++)
    {
        for(j=1;j<=m;j++)
        {
            if(v[i]==x[j]) val=1;
            else val=0;
            mat[i][j]=max(mat[i-1][j-1]+val,max(mat[i][j-1],mat[i-1][j]));
        }
    }
    g<<mat[n][m]<<'\n';
    return 0;
}