struct node{
int i, j, val;
};
set<node> 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?
№ | Пользователь | Рейтинг |
---|---|---|
1 | tourist | 3803 |
2 | jiangly | 3707 |
3 | Benq | 3627 |
4 | ecnerwala | 3584 |
5 | orzdevinwang | 3573 |
6 | Geothermal | 3569 |
6 | cnnfls_csy | 3569 |
8 | Radewoosh | 3542 |
9 | jqdai0815 | 3532 |
10 | gyh20 | 3447 |
Страны | Города | Организации | Всё → |
№ | Пользователь | Вклад |
---|---|---|
1 | maomao90 | 165 |
2 | awoo | 164 |
3 | adamant | 162 |
4 | maroonrk | 152 |
5 | -is-this-fft- | 151 |
5 | nor | 151 |
7 | atcoder_official | 147 |
8 | TheScrasse | 146 |
9 | Petr | 145 |
10 | SecondThread | 142 |
lower_bound in set<node>
struct node{
int i, j, val;
};
set<node> 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. | Язык | Кто | Когда | Δ | Комментарий | |
---|---|---|---|---|---|---|
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) |
Название |
---|