Pagini recente » Statistici Hanganu Andrei (Dezeer123q) | Cod sursa (job #1880259) | Cod sursa (job #2482428) | Cod sursa (job #1718700) | Cod sursa (job #1714178)
#include <iostream>
#define NMax 1024
#define FOR(i, a, b) for (i = a; i <= b; ++i)
#include <fstream>
using namespace std;
ifstream f("cmlsc.in");
ofstream g("cmlsc.out");
int m, n, a[NMax], b[NMax], d[NMax][NMax], sir[NMax], bst,i, j;
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])d[i][j] = 1 + d[i-1][j-1];
else d[i][j] = max(d[i-1][j], d[i][j-1]);
i=n,j=m;
while(i)
if (a[i] == b[j])
sir[++bst] = a[i], i--, j--;
else if (d[i-1][j] < d[i][j-1])j--;
else i--;
g<<bst<<"\n";
for(i = bst; i>=1; --i)g<<sir[i]<<" ";
return 0;
}