struct node{ int i, j, val; };
set A; I insert many nodes in A. Now I want to get the lower_bound for some val = k. How do I use A.lower_bound() in this case?
# | User | Rating |
---|---|---|
1 | tourist | 3690 |
2 | jiangly | 3647 |
3 | Benq | 3581 |
4 | orzdevinwang | 3570 |
5 | Geothermal | 3569 |
5 | cnnfls_csy | 3569 |
7 | Radewoosh | 3509 |
8 | ecnerwala | 3486 |
9 | jqdai0815 | 3474 |
10 | gyh20 | 3447 |
# | User | Contrib. |
---|---|---|
1 | maomao90 | 174 |
2 | awoo | 165 |
3 | adamant | 161 |
4 | TheScrasse | 160 |
5 | nor | 158 |
6 | maroonrk | 156 |
7 | -is-this-fft- | 152 |
8 | orz | 146 |
9 | SecondThread | 145 |
9 | pajenegod | 145 |
lower_bound in set
struct node{ int i, j, val; };
set A; I insert many nodes in A. Now I want to get the lower_bound for some val = k. How do I use A.lower_bound() in this case?
Rev. | Lang. | By | When | Δ | Comment | |
---|---|---|---|---|---|---|
en4 | rachitiitr | 2016-05-31 22:26:05 | 2 | |||
en3 | rachitiitr | 2016-05-31 22:25:38 | 33 | Tiny change: '; \n\nset A; \nI ' -node\ | ||
en2 | rachitiitr | 2016-05-31 22:24:47 | 41 | |||
en1 | rachitiitr | 2016-05-31 22:23:52 | 199 | Initial revision (published) |
Name |
---|