stl binary search
upper_bound
http://msdn.microsoft.com/en-us/library/7a0e117a(v=vs.71).aspx
Finds the position of the first element in an ordered range that has a value that is greater than a specified value, where the ordering criterion may be specified by a binary predicate.
lower_bound
http://msdn.microsoft.com/en-us/library/34hhk3zb(v=vs.71).aspx
Finds the position of the first element in an ordered range that has a value greater than or equivalent to a specified value, where the ordering criterion may be specified by a binary predicate.
Post by: Jalen Wang (转载请注明出处)