Cod sursa(job #1608613)

Utilizator firewavesBirsu Ion firewaves Data 22 februarie 2016 11:09:29
Problema Cel mai lung subsir comun Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 0.82 kb
#include <fstream>

using namespace std;
#define MAX 1025
#define maxim(a, b) ((a > b) ? a : b)
ifstream fin ("clsc.in");
ofstream fout("clsc.out");
int v1[MAX], v2[MAX], sol[MAX], table[MAX][MAX];
int main()
{
    int n, m;
    int i, j;
    fin >> n >> m;
    for( i = 1; i <= n; i++)
        fin >> v1[i];
    for( i = 1; i <= m; i++)
        fin >> v2[i];
    for(i = 1 ; i <= m; i++)
        for(j = 1; j <= n; j++)
            if(v2[i] == v1[j])
                    table[i][j] =  1 + table[i-1][j-1];
                    else table[i][j] = maxim(table[i][j-1], table[i-1][j]);
    fout << table[m][n] << "\n";
    j=0;
    for(i = 1; i <=n; i++)
        if(table[m][i] != j )
        {
            j++;
            fout << v1[i] << " ";
        }
    fin.close();
    fout.close();
    return 0;
}