int search(int x) // 最后一个
{
int l = 1, r = n;
while(l < r)
{
int mid = (l + r + 1) >> 1;
if(a[mid] > x) r = mid - 1;
else l = mid;
}
if(a[r] == x) return r;
else return -1;
}
int search(int x) // 第一个
{
int l = 1, r = n;
while(l < r)
{
int mid = (l + r) >> 1;
if(a[mid] < x) l = mid + 1;
else r = mid;
}
if(a[l] == x) return l;
else return -1;
}