Pagini recente » Cod sursa (job #2543662) | Cod sursa (job #2876055) | Cod sursa (job #763304) | Cod sursa (job #1194803) | Cod sursa (job #153081)
Cod sursa(job #153081)
#include<iostream>
#include<fstream>
#define max(a,b) (a>b?a:b)
using namespace std;
ifstream f("cmlsc.in");
ofstream g("cmlsc.out");
short c[1025][1025],sol[1025],x[1025],y[1025];
short i,j,m,n,comt;
void lungime()
{
for(i=1;i<=m;i++)
c[i][0]=0;
for(j=0;j<=n;j++)
c[0][j]=0;
for(i=1;i<=m;i++)
{
for(j=1;j<=n;j++)
if (x[i]==y[j]) c[i][j]=c[i-1][j-1]+1;
else c[i][j]=max(c[i][j-1],c[i-1][j]);
}
}
void scrie(int i,int j)
{
if (i==0||j==0) return;
if (c[i][j]==c[i-1][j-1]+1)
{
sol[++comt]=x[i];--i;--j;
}
else if (c[i][j]==c[i-1][j]) i--;
else j--;
scrie(i,j);}
int main()
{
f>>m>>n;
for(i=1;i<=m;f>>x[i++]);
for(j=1;j<=n;f>>y[j++]);
f.close();
lungime();
i=m;j=n;
while (i&&j)
{
if (x[i]==y[j])
{
sol[++comt]=x[i];
i--;
j--;
}
else
if (c[i-1][j]<c[i][j-1])
j--;
else
i--;
}
g<<comt<<"\n";
for(i=1;i<=comt;i++)
g<<sol[i]<<" ";
g.close();
return 0;
}