Cod sursa(job #2853674)

Utilizator MatwueiBordei Cosmin Matwuei Data 20 februarie 2022 15:15:22
Problema Cel mai lung subsir comun Scor 0
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.67 kb
#include <bits/stdc++.h>
using namespace std;

ifstream in("cmlsc.in");
ofstream out("cmlsc.out");

int n, m, i, le;
vector <int> v;
vector <pair <int, int>> a;
pair <int, int> p;

int fnd(int x){
    for(int j = le; j<v.size(); j++) if(v[j] == x) return j;
}

int main(){
    in>>n>>m;
    int b;
    for(i = 0; i<n; i++){
        in>>b;
        v.emplace_back(b);
    }
    for(i = 0; i<m; i++){
        in>>b;
        if(find(v.begin(), v.end(), b) != v.end()){
            p.first = b;
            p.second = fnd(b);
            a.emplace_back(p);
            le = p.second;
        }
    }
    out<<a.size()<<"\n";
    for(auto i:a) out<<i.first<<" ";
}