diff options
| author | Paul Jungeblut <paul.jungeblut@gmail.com> | 2016-10-06 00:14:07 +0200 |
|---|---|---|
| committer | Paul Jungeblut <paul.jungeblut@gmail.com> | 2016-10-06 00:14:07 +0200 |
| commit | 7c97303ec8fc5dfc278198687d8c5154e0cd1baf (patch) | |
| tree | 4ad42ac9f3cafeef0aa7b324b2bc8c62f29fd76c /datastructures/stlTree.cpp | |
| parent | b585d932530f755e80829bfc5d28d97b5afe1e15 (diff) | |
Adjusting datastructures chapter to new layout.
Diffstat (limited to 'datastructures/stlTree.cpp')
| -rw-r--r-- | datastructures/stlTree.cpp | 6 |
1 files changed, 4 insertions, 2 deletions
diff --git a/datastructures/stlTree.cpp b/datastructures/stlTree.cpp index a20b0dc..6dde73a 100644 --- a/datastructures/stlTree.cpp +++ b/datastructures/stlTree.cpp @@ -2,11 +2,13 @@ #include <ext/pb_ds/assoc_container.hpp> #include <ext/pb_ds/tree_policy.hpp> using namespace std; using namespace __gnu_pbds; -typedef tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> Tree; +typedef tree<int, null_type, less<int>, rb_tree_tag, + tree_order_statistics_node_update> Tree; + int main() { Tree X; for (int i = 1; i <= 16; i <<= 1) X.insert(i); // {1, 2, 4, 8, 16} cout << *X.find_by_order(3) << endl; // => 8 - cout << X.order_of_key(10) << endl; // => 4 = Nachfolger von 10 = minimales i, sodass X[i] >= 10 + cout << X.order_of_key(10) << endl; // => 4 = min i, mit X[i] >= 10 return 0; } |
