Pagini recente » Cod sursa (job #102676) | Cod sursa (job #2985748) | Cod sursa (job #709040) | Cod sursa (job #1744946) | Cod sursa (job #261053)
Cod sursa(job #261053)
#include<iostream>
#include<fstream>
using namespace std;
int a[1024], b[1024],c[1024][1024],s[1024];
int max(int a, int b)
{ if (a>b) return a;
else return b;
}
int main()
{int m, n, i, j,k=0;
ifstream f("cmlsc.in");
f>>m>>n;
for(i=1;i<=m;i++)
f>>a[i];
for(i=1;i<=n;i++)
f>>b[i];
f.close();
for(i=1;i<=m;i++)
for(j=1;j<=n;j++)
if(a[i]==b[j])
c[i][j]=c[i-1][j-1]+1;
else c[i][j]=max(c[i][j-1],c[i-1][j]);
ofstream g("cmlsc.out");
g<<c[m][n]<<endl;
i=m;
j=n;
while(i)
{ if(a[i]==b[j])
{s[++k]=a[i];
i--;
j--; }
else if(c[i][j-1]>c[i-1][j])
j--;
else i--;
}
for(i=c[m][n];i>=1;i--)
g<<s[i]<<" ";
g.close();
return 0;
}