Pagini recente » Cod sursa (job #2327948) | Cod sursa (job #12033) | Cod sursa (job #2699554) | Cod sursa (job #1032401) | Cod sursa (job #1796079)
#include<fstream>
using namespace std;
ifstream f("cmlsc.in");
ofstream g("cmlsc.out");
int n,m,a[1025],b[1025],sol[1025][1025],v[1025],k;
void citire()
{
f>>n>>m;
for(int i=1;i<=n;++i)
f>>a[i];
for(int i=1;i<=m;++i)
f>>b[i];
}
void pd1()
{
for(int i=1;i<=n;++i)
for(int j=1;j<=m;++j)
if(a[i]==b[j]) sol[i][j]=1+sol[i-1][j-1];
else
sol[i][j]=max(sol[i-1][j],sol[i][j-1]);
}
void pd2()
{
g<<sol[n][m]<<endl;
int i=n, j=m;
k=sol[i][j];
while(k>0)
{
if(a[i]==b[j])
{
v[k--]=a[i];
i--;j--;
}
else
if(sol[i][j-1]>sol[i-1][j]) j--;
else
i--;
}
for(int i=1;i<=sol[n][m];++i)
g<<v[i]<<" ";
}
int main()
{
citire();
pd1();
pd2();
}