Cod sursa(job #3322556)
| Utilizator | Data | 14 noiembrie 2025 18:31:23 | |
|---|---|---|---|
| Problema | Cel mai lung subsir comun | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.57 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("cmlsc.in");
ofstream fout("cmlsc.out");
int n,m,v[1030][1030],a[1030],b[1030];
int main()
{
fin>>n>>m;
for(int i=1;i<=n;i++)
{
fin>>a[i];
}
for(int i=1;i<=m;i++)
{
fin>>b[i];
}
for(int i=1;i<=n;i++)
{
for(int j=1;j<=m;j++)
{
if(a[i]==b[j])
v[i][j]=v[i-1][j-1]+1;
else
v[i][j]=max(v[i-1][j],v[i][j-1]);
}
}
fout<<v[n][m];
return 0;
}
