Codeforces Round #393 (Div. 2) (8VC Venture Cup 2017 – Final Round Div. 2 Edition), problem: (E) Nikita and stack Solution in C/C++
#include <bits/stdc++.h> using namespace std; const int maxn = 1e5; int a; struct segtree{ int lb, rb; int mx = 0, d = 0; segtree *l, *r; segtree(int _lb, int _rb){ lb = _lb, rb …