Cod sursa(job #3131336)
| Utilizator | Data | 19 mai 2023 21:17:09 | |
|---|---|---|---|
| Problema | Cel mai lung subsir comun | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.63 kb |
#include<fstream>
using namespace std;
ifstream fin("cmlsc.in");
ofstream fout("cmlsc.out");
int a[1050][1050],n,m,x[1050],y[1050], maxi = -1;
int main(){
fin>>n>>m;
for(int i = 1 ; i<=n;i++){
fin>>x[i];
}
for(int i = 1 ; i<=n;i++){
fin>>y[i];
}
for(int i = 1; i<= n ;i++){
for(int j =1 ; j<= m ;j++){
if(x[i]==y[j]){
a[i][j]=a[i-1][j-1] + 1;
}else{
a[i][j]= max(a[i-1][j],a[i][j-1]);
}
if(a[i][j]>maxi){
maxi = a[i][j];
}
}
}
fout<<maxi;
}
