Cod sursa(job #759784)

Utilizator tony.hegyesAntonius Cezar Hegyes tony.hegyes Data 19 iunie 2012 11:53:07
Problema Cel mai lung subsir comun Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 1.42 kb
#include <cstdio>
#include <vector>
using namespace std;

int main()
{
    freopen("cmlsc.in", "r", stdin);
    freopen("cmlsc.out", "w", stdout);
    //CITIRE DATE
    int m, n; scanf("%d %d", &m, &n);
    int matrix[m + 3][n + 2]; matrix[1][1] = matrix[m + 1][1] = 0;
    for (int i = 2; i <= m; i++) { scanf("%d", &matrix[i][0]); matrix[i][1] = 0; }
    for (int i = 2; i <= n; i++) { scanf("%d", &matrix[0][i]); matrix[m + 1][i] = matrix[1][i] = 0; }
    //CREARE TABLOU
    for (int i = 2; i <= m; i++)
        for (int j = 2; j <= n; j++)
            if (matrix[i][0] == matrix[0][j])
                matrix[i][j] = matrix[i - 1][j - 1] + 1;
            else
                matrix[i][j] = max(matrix[i - 1][j], matrix[i][j-1]);

    //RECUPERARE SUBSIR
    vector<int> subsir;
    int pos = 0;
    for (int i = 1; i <= m; i++)
        for (int j = 1; j <= n; j++)
            if (matrix[i][j] > subsir.size())
                if  (j > pos)
                {
                    subsir.push_back(matrix[i][0]);
                    pos = j;
                }
                else if (j < pos && subsir.size() == matrix[i][j])
                {
                    subsir.pop_back();
                    subsir.push_back(matrix[i][0]);
                }
    //SCRIERE REZULTATE
    printf("%d \n", matrix[m][n]);
    for (int i = 0; i < subsir.size(); i++)
        printf ("%d ", subsir[i]);

    return 0;
}