Cod sursa(job #2038888)
| Utilizator | Data | 14 octombrie 2017 09:15:56 | |
|---|---|---|---|
| Problema | Cel mai lung subsir comun | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.73 kb |
#include<fstream>
using namespace std;
int v[1024],w[1024],a[1024][1024];
int main()
{
int n,m,i,j;
ifstream fcin("cmlsc.in");
ofstream fcout("cmlsc.out");
fcin>>n>>m;
for(i=0;i<n;i++)
fcin>>v[i];
for(i=0;i<m;i++)
fcin>>w[i];
for(i=0;i<m;i++)
if(w[i]==v[0])
a[0][i]=1;
else a[0][i]=0;
for(i=1;i<n;i++)
if(v[i]==w[0])
a[0][i]=1;
else a[0][i]=0;
for(i=1;i<n;i++)
for(j=1;j<m;j++)
{
if(v[i]==w[j])
{
a[i][j]=a[i-1][j-1]+1;
}
else
{
a[i][j]=max(a[i-1][j],a[i][j-1]);
}
}
fcout<<a[n-1][m-1];
return 0;
}
