Cod sursa(job #1946505)

Utilizator leeviiTempfli Levente2 leevii Data 30 martie 2017 10:19:42
Problema Cel mai lung subsir comun Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 1.47 kb
#include <iostream>
//#include <fstream>
#include <vector>

using namespace std;

//ifstream fin("cmlsc.in");
//#define cin fin

struct matrix
{
    int a;
    short h;
};

matrix a[1025][1025];
int x[1025],y[1025];

//vector<int> o;

/*void back(int f, int g, vector<int>& x, vector<int>& y)
{
        if(x[f]==y[g])o.push_back(x[f]);
        if(a[f][g].h==1) back(f-1,g,x,y);
        if(a[f][g].h==2) back(f,g-1,x,y);
        if(a[f][g].h==3) back(f-1,g-1,x,y);
}*/

int main()
{
    int n,m;
    cin>>n>>m;
    /*int i,j;
    for(i=1;i<=n;i++)
        cin>>x[i];
    for(j=1;j<=m;j++)
        cin>>y[j];*/

    /*for(i=1;i<=n;i++)
    {
        for(j=1;j<=m;j++)
        {
            if(x[i]==y[j])
            {
                a[i][j].a=a[i-1][j-1].a+1;
                a[i][j].h=3;
            }
            else
            {
                if(a[i-1][j].a>a[i][j-1].a)
                {
                    a[i][j].a=a[i-1][j].a;
                    a[i][j].h=1;
                }
                else
                {
                    a[i][j].a=a[i][j-1].a;
                    a[i][j].h=2;
                }
            }
        }
    }*/

    /*for(i=1;i<=n;i++)
    {
        for(j=1;j<=m;j++)
        {
            cout<<a[i][j].a<<" ";
        }
        cout<<"\n";
    }*/


    //back(n,m,x,y);
    //cout<<o.size()<<"\n";
    //for(auto it=o.rbegin();it!=o.rend();it++) cout<<*it<<" ";

    return 0;
}