Pagini recente » Cod sursa (job #406205) | Cod sursa (job #194122) | Cod sursa (job #1071297) | Cod sursa (job #1089630)
#include <fstream>
#define NMAX 100005
using namespace std;
FILE* f=freopen("cautbin.in","r",stdin);
FILE* o=freopen("cautbin.out","w",stdout);
int n,m;
int v[NMAX];
int binsearch(int val)
{
int mij,st,dr;
st=0,dr=n-1;
while(st<=dr)
{
mij=st+(dr-st)/2;
if(v[mij]<=val)
st=mij+1;
else
dr=mij-1;
}
return st-1;
}
int main()
{
scanf("%d",&n);
for(int i=0;i<n;++i)
scanf("%d",&v[i]);
scanf("%d",&m);
for(int i=0;i<m;++i)
{
int t,x;
scanf("%d%d",&t,&x);
int p=binsearch(x);
switch(t)
{
case 0:
printf("%d\n",((v[p]==x)?p+1:-1));
break;
case 1:
printf("%d\n",p+1);
break;
case 2:
while(v[p]==x) p-=1;
printf("%d\n",p+2);
break;
}
}
return 0;
}