给定递增整数序列L，其大小为n，要求使用二分查找法查找任意元素的位置k(序列中第几个)； 问-Given increasing sequence of integers L, its size is n, requires the use of binary search to find the location of any element of k (the first few series)　Q