Pagini recente » Cod sursa (job #3367586) | Cod sursa (job #3367592) | Cod sursa (job #3367582) | Cod sursa (job #3364812) | Cod sursa (job #3365605)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("cautbin.in");
ofstream fout("cautbin.out");
int v[100002];
int cautare_b(int n,int x,int v[])
{
int st=1,dr=n,r=-1;
while(st<=dr)
{
int m=(st+dr)/2;
if(v[m]==x)
{
r=m;
st=m+1;
}
else if(v[m]>x)
{
dr=m-1;
}
else st=m+1;
}
return r;
}
int cautare_b1(int n,int x,int v[])
{
int st=1,dr=n,r=-1;
while(st<=dr)
{
int m=(st+dr)/2;
if(v[m]<=x)
{
r=m;
st=m+1;
}
else dr=m-1;
}
return r;
}
int cautare_b2(int n,int x,int v[])
{
int st=1,dr=n,r=-1;
while(st<=dr){
int m=(st+dr)/2;
if(v[m]>=x){
r=m;
dr=m-1;
}else st=m+1;
}
return r;
}
int main()
{
int n,m,x,t;
fin>>n;
for(int i=1; i<=n; i++)
{
fin>>v[i];
}
fin>>m;
for(int i=1; i<=m; i++)
{
fin>>t>>x;
if(t==0){
fout<<cautare_b(n,x,v)<<endl;
}else if(t==1){
fout<<cautare_b1(n,x,v)<<endl;
}else fout<<cautare_b2(n,x,v)<<endl;
}
return 0;
}