{"image_url":null,"url":"https://yosupo.hatenablog.com/entry/2018/08/11/005239","categories":[],"blog_url":"https://yosupo.hatenablog.com/","published":"2018-08-11 00:52:39","html":"<iframe src=\"https://hatenablog-parts.com/embed?url=https%3A%2F%2Fyosupo.hatenablog.com%2Fentry%2F2018%2F08%2F11%2F005239\" title=\"\u9045\u5ef6SegTree - \u3088\u3059\u307d\u306e\u65e5\u8a18\" class=\"embed-card embed-blogcard\" scrolling=\"no\" frameborder=\"0\" style=\"display: block; width: 100%; height: 190px; max-width: 500px; margin: 10px 0px;\"></iframe>","provider_url":"https://hatena.blog","type":"rich","height":"190","blog_title":"\u3088\u3059\u307d\u306e\u65e5\u8a18","description":"\u8272\u3005\u96a0\u853d\u306e\u65b9\u6cd5\u3092\u8003\u3048\u3066\u3044\u307e\u3059\u3002 \u3053\u308c\u306f\u306a\u3093\u304b\u3054\u3064\u3044\u306d #include <bits/stdc++.h> using namespace std; using uint = unsigned int; template<class T> using V = vector<T>; template<class OP> struct SegTree { using D = typename OP::D; using L = typename OP::L; static constexpr auto e_d = OP::e_d; static constexpr auto e_l = OP::e_l;\u2026","version":"1.0","author_url":"https://blog.hatena.ne.jp/yosupo/","title":"\u9045\u5ef6SegTree","width":"100%","provider_name":"Hatena Blog","author_name":"yosupo"}