문제 링크 : boj.kr/3172난이도 : P4태그 : 세그먼트 트리, 정렬코드#include #define all(x) (x).begin(), (x).end()#define INF 0x7FFFFFFFusing namespace std;using ll = long long;using ld = long double;using pii = pair;using pll = pair;bool comp(pair a, pair b) { reverse(all(a.first)); reverse(all(b.first)); return a.first class segTree {private: ll n; T id; T(*merge)(T, T); vector tree;public: s..