lickelon.log

문제 링크 : boj.kr/15816난이도 : 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;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->id = id; ..

문제 링크 : boj.kr/2517난이도 : 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;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->id = id; t..

문제 링크 : 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 ..

문제 링크 : boj.kr/18869난이도 : G5태그 : 좌표압축코드#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;void process(vector& arr) { vector temp(arr.begin(), arr.end()); sort(all(temp)); temp.erase(unique(all(temp)), temp.end()); for(int i = 0; i > m >> n; vector> arr(m, vector(n));..