#include #include #include #include template struct SegmentTree { using Merger = std::function; int length; std::vector dat; T unit; Merger merge; SegmentTree() = default; SegmentTree(int n, const T& unit, const Merger& merge) : length(1), unit(unit), merge(merge) { while (length < n) length <<= 1; dat.assign(length * 2, unit); } template SegmentTree(const Container& elems, const T& unit, const Merger& merge) : length(1), unit(unit), merge(merge) { int n = elems.size(); while (length < n) length <<= 1; dat.assign(length * 2, unit); std::copy(elems.begin(), elems.end(), dat.begin() + length); for (int nidx = length - 1; nidx >= 1; --nidx) { T vl = dat[nidx * 2 + 0]; T vr = dat[nidx * 2 + 1]; dat[nidx] = merge(vl, vr); } } void update(int nidx, const T& elem) { nidx += length; dat[nidx] = elem; while (nidx > 0) { nidx >>= 1; T vl = dat[nidx * 2 + 0]; T vr = dat[nidx * 2 + 1]; dat[nidx] = merge(vl, vr); } } T fold(int ql, int qr) const { ql = std::max(ql, 0); qr = std::min(qr, length); ql += length, qr += length; T lacc = unit, racc = unit; while (ql < qr) { if (ql & 1) { lacc = merge(lacc, dat[ql]); ++ql; } if (qr & 1) { --qr; racc = merge(dat[qr], racc); } ql >>= 1, qr >>= 1; } return merge(lacc, racc); } T get(int idx) const { return dat[idx + length]; } T fold_all() const { return dat[1]; } }; void solve() { int n; std::cin >> n; std::vector xs(n), xrev(n); for (int i = 0; i < n; ++i) { std::cin >> xs[i]; xrev[--xs[i]] = i; } SegmentTree seg(n, 0, [](auto a, auto b) { return std::max(a, b); }); std::vector ans; for (int i = 0; i < n; ++i) { int y; std::cin >> y; int j = xrev[--y]; if (seg.fold(j, n) == 0) ans.push_back(y); seg.update(j, 1); } std::sort(ans.begin(), ans.end()); for (auto x : ans) std::cout << x + 1 << "\n"; } int main() { std::cin.tie(nullptr); std::ios::sync_with_stdio(false); solve(); return 0; }