lickelon.log

문제 링크 : boj.kr/16993난이도 : P1태그 : 세그먼트 트리코드#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; this->..

문제 링크 : boj.kr/9034난이도 : P3태그 : 세그먼트 트리코드#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; this->m..

문제 링크 : boj.kr/5000난이도 : P3태그 : 세그먼트 트리코드#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; this->m..

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

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

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

문제 링크 : boj.kr/23024난이도 : 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/22959난이도 : 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/20052난이도 : 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/18874난이도 : 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..