Pagini recente » Cod sursa (job #1229270) | Cod sursa (job #2793041)
#include <fstream>
using namespace std;
ifstream cin("cmlsc.in");
ofstream cout("cmlsc.out");
int dp[100][100], n, a[100], m, b[100];
int main()
{
cin>>n>>m;
for(int i=1;i<=n;i++)
cin>>a[i];
for(int i=1;i<=m;i++)
cin>>b[i];
for(int i=0;i<=n;i++)
dp[i][0]= 0;
for(int j=0;j<=m;j++)
dp[0][j] = 0;
for(int i=1;i<=n;i++)
{
for(int j=1;j<=m;j++)
{
if(a[i] == b[j])
dp[i][j] = dp[i-1][j-1] + 1;
else
dp[i][j] = max(dp[i-1][j], dp[i][j-1]);
}
}
cout<<dp[n][m]<<"\n";
for(int i=0;i<=n;i++)
{
for(int j=0;j<=m;j++)
cout<<dp[i][j]<<" ";
cout<<"\n";
}
cout<<"\n\n";
int lung = dp[n][m];
for(int i=1, k = 0;i<=m;i++)
if(dp[n][i] != k)
{
k++;
cout<<b[i]<<' ';
}
return 0;
}