Unverified Commit 6d4d924d authored by partychicken's avatar partychicken Committed by GitHub
Browse files

Merge branch 'master' into partychicken-patch-2

parents 6bb5657c 544faf9a

docs/ds/odt.md

+1 −1
Original line number Diff line number Diff line
@@ -29,7 +29,7 @@ struct Node_t { 
  int l, r;

  mutable int v;

  Node_t(const int &il, const int &ir, const int &iv) : l(il), r(ir), v(iv) {}

  inline bool operator(const Node_t &o) const { return l < o.l; }

  inline bool operator<(const Node_t &o) const { return l < o.l; }

};

```

docs/ds/pb-ds/priority-queue.md

+1 −1
Original line number Diff line number Diff line
@@ -18,7 +18,7 @@ __gnu_pbds ::priority_queue<T, Compare, Tag, Allocator> 
    -    `binary_heap_tag` ：二叉堆 

        官方文档认为在原生元素中二叉堆表现最好，不过我测试的表现并没有那么好

    -    `binomial_heap_tag` ：二项堆

        二项堆在合并操作的表现要优于配对堆\*但是其取堆顶元素的

        二项堆在合并操作的表现要优于二叉堆，但是其取堆顶元素操作的复杂度比二叉堆高。

    -    `rc_binomial_heap_tag` ：冗余计数二项堆

    -    `thin_heap_tag` ：除了合并的复杂度都和 Fibonacci 堆一样的一个 tag

-    `Allocator` ：空间配置器，由于 OI 中很少出现，故这里不做讲解

docs/ds/splay.md

+1 −1
Original line number Diff line number Diff line
@@ -67,8 +67,8 @@ void rotate(int x) { 
  fa[y] = x;

  fa[x] = z;

  if (z) ch[z][y == ch[z][1]] = x;

  maintain(x);

  maintain(y);

  maintain(x);

}

```

mkdocs.yml

+2 −2
Original line number Diff line number Diff line
@@ -318,13 +318,13 @@ extra: 
  githash: ''



extra_javascript:

  - 'https://cdn.jsdelivr.net/gh/ethantw/Han@3.3.0/dist/han.min.js'

  - 'https://s3.pstatp.com/cdn/expire-1-M/Han/3.3.0/han.min.js'

  - '_static/js/extra.js?v=10'

  - 'https://cdnjs.loli.net/ajax/libs/mathjax/2.7.5/MathJax.js?config=TeX-MML-AM_CHTML'





extra_css:

  - 'https://cdn.jsdelivr.net/npm/ah@1.2.0/han.min.css'

  - 'https://npm.elemecdn.com/ah@1.5.0/han.min.css'

  - '_static/css/extra.css?v=11'



# Extensions