Cod sursa(job #1630897)
Utilizator | Data | 5 martie 2016 11:55:29 | |
---|---|---|---|
Problema | Cel mai lung subsir comun | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.53 kb |
#include <fstream>
using namespace std;
ifstream fin ("cmlsc.in");
ofstream fout ("cmlsc.out");
short int lg[1025][1025],a[1025],b[1025],n,m;
void citire()
{
int i;
fin>>n>>m;
for(i=1;i<=n;i++)
fin>>a[i];
for(i=1;i<=m;i++)
fin>>b[i];
}
int main()
{
int i,j;
citire();
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
if(a[i]==b[j])
lg[i][j]=lg[i-1][j-1]+1;
else
lg[i][j]=max(lg[i-1][j],lg[i][j-1]);
fout<<lg[n][m]<<endl;
return 0;
}