Cod sursa(job #2635153)

Utilizator BogdanTicuTicu Bogdan Valeriu BogdanTicu Data 13 iulie 2020 15:34:57
Problema Cel mai lung subsir comun Scor 40
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.6 kb
#include <bits/stdc++.h>

using namespace std;

ifstream in("cmlsc.in");
ofstream out("cmlsc.out");

int dp[1030][1030],a[1030],b[1030],v[1030];
int main()
{
	int n,m,k=0;
	in>>n>>m;
	for(int i=1;i<=n;i++)
		in>>a[i];
	for(int j=1;j<=m;j++)
		in>>b[j];
	for(int i=1;i<=n;i++)
		for(int j=1;j<=m;j++)
		{
			int x=0;
			if(a[i]==b[j]) {
				x++;
			}
			dp[i][j]=max(dp[i-1][j-1]+x,max(dp[i][j-1],dp[i-1][j]));
		}
	int ct=dp[n][m];
	for(int i=n;i>0&&ct;i--)
		for(int j=m;j>0&&ct;j--)
			if(a[i]==b[j]){
				ct--;
				v[++k]=a[i];
			}
	out<<dp[n][m]<<"\n";
	for(int i=k;i>0;i--)
		out<<v[i]<<" ";
	return 0;
}