Cod sursa(job #3279041)
| Utilizator | Data | 21 februarie 2025 18:34:14 | |
|---|---|---|---|
| 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 a[1024],b[1024],n,m;
int v[1025][1025],r;
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=n; i>=1; i--)
{
for(int j=m; j>=m; j--)
{
if(a[j]!=b[i])
{
v[i][j]=max(v[i-1][j],v[i][j-1]);
}
else if(a[j]==b[i])
{
v[i][j]=1+v[i-1][j-1];
}
}
}
int l=v[n][m];
fout<<l;
return 0;
}