Cod sursa(job #2607720)
| Utilizator | Data | 30 aprilie 2020 08:37:00 | |
|---|---|---|---|
| Problema | Cel mai lung subsir comun | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.48 kb |
#include <bits/stdc++.h>
#define MAXSIZE 1025
using namespace std;
ifstream fin("cmlsc.in");
ofstream fout("cmlsc.out");
int n,m,v[MAXSIZE],w[MAXSIZE],i,j;
int dp[MAXSIZE][MAXSIZE];
int main()
{
fin >>m>>n;
for(i=1;i<=m;i++)
fin >> v[i];
for(i=1;i<=n;i++)
fin>>w[i];
for(i=1;i<=m;i++){
for(j=1;j<=n;j++){
dp[i][j] = max(dp[i][j-1], max(dp[i-1][j],dp[i-1][j-1] + (v[i] == w[j])));
}
}
fout<<dp[m][n];
return 0;
}