lickelon.log

문제 링크 : boj.kr/11505난이도 : G1태그 : 세그먼트 트리코드#include #define all(x) (x).begin(), (x).end()#define INF 0x7FFFFFFF#define MOD 1000000007using namespace std;using ll = long long;using ld = long double;using pii = pair;using pll = pair;templateclass segTree {private: ll n; T id; T(*merge)(T, T); vector tree;public: segTree(ll n, T id, T(*merge)(T, T)) { this->n = n; this->..

문제 링크 : boj.kr/27518난이도 : P3태그 : 세그먼트 트리, 좌표압축코드#include #define all(x) (x).begin(), (x).end()#define INF 0x7FFFFFFF#define MOD 1000000007llusing namespace std;using ll = long long;using ld = long double;using pii = pair;using pll = pair;void update(vector &tree, int node, int s, int e, int idx, ll diff) { if(idx &tree, int node, int s, int e, int l, int r) { if(l > e || r > n; vector ..