Pagini recente » Cod sursa (job #1632957) | Cod sursa (job #2603126) | Cod sursa (job #76996) | Borderou de evaluare (job #1796710) | Cod sursa (job #1357335)
#include <fstream>
#define nmax 1025
using namespace std;
ifstream f("cmlsc.in");
ofstream g("cmlsc.out");
int n,m,ma[nmax][nmax],a[nmax],b[nmax],i,j,x,sol[nmax];
int max(int a, int b)
{
if (a>=b)
return a;
else return b;
}
int main()
{
f>>n>>m;
for (i=1;i<=n;i++)
f>>a[i];
for (i=1;i<=m;i++)
f>>b[i];
for (i=1;i<=n;i++)
for (j=1;j<=m;j++)
{
if (a[i]==b[j])
ma[i][j]=1+ma[i-1][j-1];
else ma[i][j]=max(ma[i-1][j],ma[i][j-1]);
}
i=n;j=m;
x=1;
while (ma[i][j])
{
while (ma[i][j]==ma[i-1][j])
i--;
while (ma[i][j]==ma[i][j-1])
j--;
sol[x]=a[i];
x++;
i--; j--;
}
g<<ma[n][m]<<"\n";
for (i=x-1;i>=1;i--)
g<<sol[i]<<" ";
f.close();
g.close();
return 0;
}