Pagini recente » Cod sursa (job #1701783) | Cod sursa (job #355766) | Cod sursa (job #1949911) | Cod sursa (job #1564799) | Cod sursa (job #629688)
Cod sursa(job #629688)
#include<cstdio>
#include<vector>
using namespace std;
#define NMAX 1024
int s[NMAX][NMAX];
int main()
{
vector<int>sol;
int a[NMAX],b[NMAX],i,j,m,n,max;
freopen("cmlsc.in","r",stdin);
freopen("cmlsc.out","w",stdout);
scanf("%d%d",&n,&m);
for(i=1;i<=n;i++) scanf("%d",&a[i]);
for(i=1;i<=m;i++) scanf("%d",&b[i]);
for(i=1;i<=n;i++)
{
for(j=1;j<=m;j++)
{
if(a[i]==b[j]) s[i][j]=s[i-1][j-1]+1;
else if(s[i][j-1]>s[i-1][j]) s[i][j]=s[i][j-1];
else s[i][j]=s[i-1][j];
}
}
max=s[n][m];
printf("%d\n",max); i=1;j=1;
i=n;j=m;
while(s[i][j])
{
if(a[i]==b[j])
{
sol.push_back(a[i]);
i--;j--;
}
else if(s[i-1][j]<s[i][j-1]) j--;
else i--;
}
for(i=max-1;i>=0;i--) printf("%d ",sol[i]);
return 0;
}