- Programming Notes·Last edited by 林立倫 on Nov 23, 2021Linked with GitHubContributed by
There is no commentSelect some text and then click Comment, or simply add a comment to this page from below to start a discussion.Read more
Fenwick Tree
Motivation Given a list of elements, we want to calculate cumulative total based on an associative binary operation. Moreover, efficient modification is desired. Naive Concept Using an array arr to store each element in the original list.
Nov 26, 2021Disjoint Sets
Motivation Design a data structure that stores a partition of a set. With the operations of union, find, etc. Naive Way-A: Update the Set Each Element Belongs to Find: $O(1)$ Make Union: $O(N)$
Nov 26, 2021Segment Tree
Range Minimum (Maximum) Query class SegmentTree { public: SegmentTree(size_t size) : N(size), arr(size << 2, 0), tag(size << 2, 0) {} int query(int left, int right) { return query(1, 1, N, left, right); } void modify(int left, int right, int val) {
Nov 26, 2021Index
Programming Notes Data Structure BigInteger Fenwick Tree Disjoint Sets Segment Tree
Nov 23, 2021
HackMD