We have a group of N items (represented by integers from 1 to N), and we know that there is some total order defined for these items. You may assume that no two elements will be equal (for all a, b: a<b or b<a). However, it is expensive to compare two items. Your task is to make a number of comparis ...
/dl/247529.html
标签：
represented
integers
group
items
上传时间：
2016-01-17
上传用户：jeffery
