Assume you're given a set of functions such that each two can intersect at most once. Let's keep in each vertex of a segment tree some function in such way, that if we go from root to the leaf it will be guaranteed that one of the functions we met on the ...
The implementation of described LCA algorithm is as follows, using a segment tree: ``` ```cpp typedef vector < vector<int> > graph; typedef vector<int>::const_iterator const_graph_iter; Expand Down 54 changes: 28 additions & 26 deletions 54 src/graph/mst_kruskal.md Show comments ...
that you can use.Google translateandYandex translatework pretty good. They are not perfect (e.g. Google translate might saytopinstead ofvertex), but from the context it is always clear what the correct translation should be.
test test_fenwick_tree.cpp test_segment_tree.cpp 7 changes: 3 additions & 4 deletions 7 src/data_structures/fenwick.md Original file line numberDiff line numberDiff line change @@ -127,7 +127,7 @@ This is handled in the `sum(int l, int r)` method. Also this implementation suppor...
8 - 1. The function is strictly increasing first, then reaches a maximum (at one point or the whole segment), then it is strictly decreasing. 7 + 1. The function strictly increases first, reaches a maximum (at one point or at a segment), and then strictly decreases. 9 8 10 -...