Pagini recente » Cod sursa (job #2503278) | Cod sursa (job #972082) | Cod sursa (job #3194156) | Cod sursa (job #1819756) | Cod sursa (job #667323)
Cod sursa(job #667323)
#include <fstream>
#define maxn 1030
using namespace std;
ifstream f("secvmin.in");
ofstream g("secvmin.out");
int m,n,a[maxn],b[maxn],d[maxn][maxn],s[maxn];
int main()
{
int k=0,i=0,j=0;
f>>m>>n;
for(i=1;i<=m;i++)
f>>a[i];
for(i=1;i<=n;i++)
f>>b[j];
for(i=1;i<=m;i++)
for(j=1;j<=n;j++)
if(a[i]==b[j])
d[i][j]=d[i-1][j-1]+1;
else
if (d[i-1][j] > d[i][j-1])
d[i][j]=d[i-1][j];
else d[i][j]=d[i][j-1];
g<<d[i][j];
return 0;}