Cod sursa(job #810231)

Utilizator ioanaaa_cCiurea Ioana ioanaaa_c Data 9 noiembrie 2012 22:07:14
Problema Cel mai lung subsir comun Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 0.84 kb
#include <fstream>
#define maxim(x, y) ((x > y) ? x : y)

using namespace std;
ifstream fin("cmlsc.in");
ofstream fout("cmlsc.out");

int n, m;
int lcs[1025][1025], a[1025], b[1025], op[1025][1025];

void citire();
void pd();
void afisare();

int main()
{
    citire();
    pd();
    afisare();
    return 0;
}

void citire()
{
    int i;
	fin>>n>>m;
    for(i=0; i<n; i++)
        fin>>a[i];
    for(i=0; i<m; i++)
        fin>>b[i];
}

void pd()
{
	int i, j;
    for(i=n-1; i>=0; i--)
		for(j=m-1; j>=0; j--)
			if(a[i]==b[j])
			{
				lcs[i][j]=1+lcs[i+1][j+1];
				op[i][j]=1;
			}
			else
			{
				lcs[i][j]=maxim(lcs[i+1][j], lcs[i][j+1]);
				if(lcs[i+1][j]>=lcs[i][j+1])
					op[i][j]=2;
				else
					op[i][j]=3;
			}

}

void afisare()
{
    fout <<lcs[0][0] <<'\n';
    fout.close();
}