261页binaryMaxIndexSmallerThanValue

#include <iostream>
#include <vector>

using namespace std;

template <typename Type>
int binaryMaxIndexSmallerThanValue(const vector<Type> &array ,Type keyValue){
	if(array.size()==0)
		return -1;

	int left=0,right=array.size()-1;
	while(left<right-1){
		int midIndex=left+(right-left)/2;
		if(array[midIndex]<keyValue)  
			left=midIndex;
		else                          //此等号位置非常重要
			right=midIndex;
	}

	if(array[right]<keyValue)
		return right;
	if(array[left]<keyValue)
		return left;
	return -1;
}

int main(){
	vector<int> sss;
	for(int i=1;i<100;++i){
		sss.push_back(49);
	}
	int index=binaryMaxIndexSmallerThanValue(sss,50);
	if(index>=0)
	   cout<<index<<" "<<sss[index]<<endl;
	else
	   cout<<"NULL"<<endl;
	system("pause");
}