searchRange

#include<iostream>
#include<algorithm>
#include<vector>
using namespace std;
vector<int> searchRange(int A[],int n,int target)
{
int l=distance(A,lower_bound(A,A+n,target));
int u=distance(A,prev(upper_bound(A,A+n,target)));
if(A[l]!=target)
{
int result[]={-1,-1};
return vector<int> (result,result+sizeof(result)/sizeof(int));
}
int result[]={l,u};
return vector<int> (result,result+sizeof(result)/sizeof(int));
}
int main()
{
int A[]={5,7,7,8,8,10};
vector<int> v=searchRange(A,sizeof(A)/sizeof(int),-1);
for(auto i:v)
cout<<i<<endl;
return 0;
}