Cod sursa(job #2321127)

Utilizator Teodor2305Teodor Chirosca Teodor2305 Data 15 ianuarie 2019 18:44:46
Problema Cel mai lung subsir comun Scor 20
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.58 kb
#include <iostream>
#include <fstream>

using namespace std;

int main()
{
	ifstream f("cmlsc.in");
	ofstream g("cmlsc.out");
	int m, n, a[1025], b[1025], c[1025], i, j, l, rez;

	f >> m >> n;

	for(i=1; i<=m; i++)
		f >> a[i];

	for(i=1; i<=n; i++)
		f >> b[i];

	i = 1;
	j = 1;
	l = 1;
	rez = 0;

	while(i <= m && l <= n)
	{
		j = l;

		while(j <= n)
		{
			if(a[i] == b[j])
			{
				rez++;
				c[rez] = a[i];

				i++;
				j++;
				l = j;
			}
			else
			{
				j++;
			}
		}

		i++;
	}

	g << rez << endl;

	for(i=1; i<=rez; i++)
		g << c[i] << ' ';

	f.close();
	g.close();
	return 0;
}