Pagini recente » Cod sursa (job #1332428) | Cod sursa (job #1951290) | Cod sursa (job #2412957) | Cod sursa (job #3258302) | Cod sursa (job #1780043)
#include<fstream>
#include<vector>
#include<algorithm>
using namespace std;
int main()
{
int i,x,y,j,a,b,c=0,d=0;
ifstream fin ("cmlsc.in");
ofstream fout ("cmlsc.out");
fin>>x>>y;
int m[x][y]={},v[x]={},v1[y]={},v2[1024]={};
for(i=0;i<x;++i)
{
fin>>v[i];
}
for(j=0;j<y;++j)
{
fin>>v1[j];
}
m[0][0]=0;
for(i=1;i<x;++i)
{
if(v[i]==v1[0])
{
m[i][0]=m[i-1][0]+1;
}
else
{
m[i][0]=m[i-1][0];
}
}
for(j=1;j<y;++j)
{
if(v[0]==v1[j])
{
m[0][j]=m[0][j-1]+1;
}
else
{
m[0][j]=m[0][j-1];
}
}
for(i=1;i<x;++i)
{
for(j=1;j<y;++j)
{
if(v[i]==v1[j])
{
m[i][j]=max(m[i-1][j]+1,m[i][j-1]+1);
}
else
{
m[i][j]=max(m[i-1][j],m[i][j-1]);
}
}
}
fout<<m[x-1][y-1]<<endl;
a=x-1;
b=y-1;
while(m[a][b])
{
if(m[a][b]==m[a-1][b])
{
a--;
}
else
{
v2[c]=v[a];
c++;
a--;
b--;
}
}
while(c)
{
fout<<v2[c-1]<<" ";
c--;
d++;
}
}