reorg

Author: lrvideckis

library/data_structures_[l,r)/seg_tree.hpp

@@ -15,6 +15,7 @@ template<class T, class F> struct tree {
   vector<T> s;
   tree(int n, T unit, F op):
     n(n), unit(unit), op(op), s(2 * n, unit) {}
+#include "seg_tree_uncommon/init.hpp"
   void update(int i, T val) {
     for (s[i += n] = val; i /= 2;)
       s[i] = op(s[2 * i], s[2 * i + 1]);

…uctures_[l,r]/seg_tree_uncommon/init.hpp …uctures_[l,r)/seg_tree_uncommon/init.hpplibrary/data_structures_[l,r]/seg_tree_uncommon/init.hpp renamed to library/data_structures_[l,r)/seg_tree_uncommon/init.hpp library/data_structures_[l,r]/seg_tree_uncommon/init.hpp renamed to library/data_structures_[l,r)/seg_tree_uncommon/init.hpp

@@ -20,7 +20,7 @@ template<class T, class F> struct tree {
   vector<T> s;
   tree(int n, T unit, F op):
     n(n), op(op), s(2 * n, unit) {}
-#include "seg_tree_uncommon/init.hpp"
+#include "../data_structures_[l,r)/seg_tree_uncommon/init.hpp"
   void update(int i, T val) {
     for (s[i += n] = val; i /= 2;)
       s[i] = op(s[2 * i], s[2 * i + 1]);