Cod sursa(job #2443490)

Utilizator bogdanmicamica bogdan bogdanmica Data 28 iulie 2019 13:16:53
Problema Cel mai lung subsir comun Scor 0
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.63 kb
#include <iostream>
#include<fstream>
using namespace std;
ifstream f("cmlsc.in");
ofstream g("cmlsc.out");
int n,m,a[1000],b[1000];
void citire()
{f>>n>>m;
for(int i=1;i<=n;i++)
    f>>a[i];
for(int i=1;i<=m;i++)
    f>>b[i];
}
int secv[1000][1000];

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

 g<<secv[n][m];
    return 0;
}