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 | 3843 |
2 | jiangly | 3705 |
3 | Benq | 3628 |
4 | orzdevinwang | 3571 |
5 | Geothermal | 3569 |
5 | cnnfls_csy | 3569 |
7 | jqdai0815 | 3530 |
8 | ecnerwala | 3499 |
9 | gyh20 | 3447 |
10 | Rebelz | 3409 |
Страны | Города | Организации | Всё → |
№ | Пользователь | Вклад |
---|---|---|
1 | maomao90 | 171 |
2 | awoo | 163 |
2 | adamant | 163 |
4 | TheScrasse | 157 |
5 | nor | 153 |
6 | maroonrk | 152 |
6 | -is-this-fft- | 152 |
8 | Petr | 145 |
9 | orz | 144 |
9 | pajenegod | 144 |
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) |
Название |
---|