Pagini recente » Cod sursa (job #2255967) | Cod sursa (job #2337568) | Cod sursa (job #1409827) | Cod sursa (job #2935045) | Cod sursa (job #1092103)
#include <fstream>
using namespace std;
ifstream r("cmlsc.in");
ofstream w("cmlsc.out");
unsigned n,m,i,j,a[1025],b[1025],c[1025][1025];
#define MAX(a,b) ((a) > (b) ? (a) : (b))
unsigned LCSLenghth()
{
for(i=1;i<=n;i++)
for(j=1;j<=m;j++)
if(a[i]==b[j]) c[i][j] = c[i-1][j-1]+1;
else c[i][j] = MAX(c[i-1][j],c[i][j-1]);
return c[n][m];
}
unsigned backtrack(unsigned i,unsigned j)
{
if(i>n || j>m) return 0;
else
if(a[i]==b[j]) { w<<a[i]<<" "; return backtrack(i+1,j+1); }
else
if(c[i+1][j]>c[i][j+1]) return backtrack(i+1,j);
else return backtrack(i,j+1);
}
int main()
{
r>>n>>m;
for(i=1;i<=n;i++) r>>a[i]; for(i=1;i<=m;i++) r>>b[i];
w<<LCSLenghth()<<"\n";
backtrack(1,1);
r.close(); w.close();
return 0;
}