Pagini recente » Istoria paginii runda/25tui/clasament | Cod sursa (job #2649009) | Cod sursa (job #2757725) | Istoria paginii runda/oni2014_z1_ix/clasament | Cod sursa (job #1879980)
#include <bits/stdc++.h>
using namespace std;
ifstream f("cmlsc.in");
ofstream g("cmlsc.out");
int x[1025],y[1025],n,m;
int lcs[1025][1025],MAX;
void LCS()
{
for(int k=1;k<=n;k++)
for(int h=1;h<=m;h++)
if(x[k]==y[h]) {lcs[k][h]=1+lcs[k-1][h-1];MAX++;}
else if(lcs[k-1][h]>lcs[k][h-1]) lcs[k][h]=lcs[k-1][h];
else lcs[k][h]=lcs[k][h-1];
}
void afiseaza_solutie(int k,int h)
{
if(lcs[k][h])
if(x[k]==y[h])
{afiseaza_solutie(k-1,h-1);
g<<x[k]<<' ';
}
else
{if(lcs[k][h]==lcs[k-1][h])
afiseaza_solutie(k-1,h);
else if(lcs[k][h]==lcs[k][h-1])
afiseaza_solutie(k,h-1);
}
}
int main()
{
f>>n>>m;
for(int i=1;i<=n;i++) f>>x[i];
for(int i=1;i<=m;i++) f>>y[i];
LCS();
g<<MAX<<endl;
afiseaza_solutie(n,m);
return 0;
}