Skip to content

Commit

Permalink
Update docs
Browse files Browse the repository at this point in the history
  • Loading branch information
ruthen71 committed Mar 25, 2024
1 parent d85cf61 commit 6392a5e
Show file tree
Hide file tree
Showing 5 changed files with 6 additions and 5 deletions.
Original file line number Diff line number Diff line change
@@ -1,6 +1,6 @@
---
title: ローリングハッシュ
documentation_of: //algebra/monoid_rolling_hash.hpp
documentation_of: //algebra/monoid_s/monoid_rolling_hash.hpp
---

clang でコンパイルするときには `-std=c++2b` をつける
Expand Down
2 changes: 1 addition & 1 deletion docs/data_structure/dual_segment_tree.md
Original file line number Diff line number Diff line change
Expand Up @@ -13,7 +13,7 @@ documentation_of: //data_structure/dual_segment_tree.hpp
#include "algebra/monoid_f/monoid_set.hpp"
#include "data_structure/dual_segment_tree.hpp"
int main() {
vector<int> A = {3, 1, 4, 1, 5};
vector<int> A;
DualSegmentTree<MonoidSet<int>> seg(A);
}
```
Expand Down
3 changes: 2 additions & 1 deletion docs/data_structure/lazy_segment_tree.md
Original file line number Diff line number Diff line change
Expand Up @@ -10,7 +10,7 @@ documentation_of: //data_structure/lazy_segment_tree.hpp
#include "algebra/monoid_s_f/monoid_sum_size_set.hpp"
#include "data_structure/lazy_segment_tree.hpp"
int main() {
vector<pair<int, int>> A = {{3, 1}, {1, 1}, {4, 1}, {1, 1}, {5, 1}};
vector<pair<int, int>> A;
SegmentTree<MonoidSumSizeSet<int>> seg(A);
}
```
Expand All @@ -20,6 +20,7 @@ int main() {

## 参考資料
[maspyさんの解説記事](https://maspypy.com/segment-tree-%e3%81%ae%e3%81%8a%e5%8b%89%e5%bc%b72)

区間作用 = apply(l, r, f)
- 作用素の伝搬 = push を含む部分
- 作用素の追加 = all_apply を含む部分
Expand Down
2 changes: 1 addition & 1 deletion docs/data_structure/segment_tree.md
Original file line number Diff line number Diff line change
Expand Up @@ -10,7 +10,7 @@ documentation_of: //data_structure/segment_tree.hpp
#include "algebra/monoid_s/monoid_sum.hpp"
#include "data_structure/segment_tree.hpp"
int main() {
vector<int> A = {3, 1, 4, 1, 5};
vector<int> A;
SegmentTree<MonoidSum<int>> seg(A);
}
```
Expand Down
2 changes: 1 addition & 1 deletion docs/data_structure/segment_tree_2d.md
Original file line number Diff line number Diff line change
Expand Up @@ -10,7 +10,7 @@ documentation_of: //data_structure/segment_tree_2d.hpp
#include "algebra/monoid_s/monoid_sum.hpp"
#include "data_structure/segment_tree_2d.hpp"
int main() {
vector<vector<int>> A = {{3, 1, 4}, {1, 5, 9}};
vector<vector<int>> A;
SegmentTree2D<MonoidSum<int>> seg(A);
}
```
Expand Down

0 comments on commit 6392a5e

Please sign in to comment.