lower_bound:返回最小的大于等于key的位置
upper_bound:返回最小的大于key的位置
头文件:algorithm
注意:当使用lower_bound时key的值大于最大的值,查找到的位置是越界的(最大下标+1)
格式:假设数组为a,长度为n,pos = lower_bound(a,a+n,key) - a,或者是pos = upper_bound(a,a+n,key) - a
实例代码:
#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
const int MAXN = 500000 + 100;
int a[MAXN];
int b[MAXN];
using namespace std;
int main()
{
int n,left,right,mid;
while(~scanf("%d",&n))
{
memset(b,0,sizeof(b));
int len = 1;
for(int i = 1;i <= n;i++)
{
scanf("%d",a[i]);
}
b[1] = a[1];
for(int i = 2;i <= n;i++)
{
left = 1;
right = len;
while(left < right)
{
mid = (left + right) / 2;
if(a[i] >= b[mid])
left = mid + 1;
else
right = mid;
}
if(b[right] > a[i])
{
b[right] = a[i];
}
else
b[++len] = a[i];
}
printf("%d\n",len);
}
return 0;
}