Cod sursa(job #2775946)
Utilizator | Data | 18 septembrie 2021 11:09:59 | |
---|---|---|---|
Problema | Cautare binara | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 1.22 kb |
#include <fstream>
using namespace std;
ifstream cin("cautbin.in");
ofstream cout("cautbin.out");
int n,v[100005],i,q,j,p,x,m,st,dr,poz;
int main()
{
cin>>n;
for(i=1; i<=n; i++)
cin>>v[i];
cin>>q;
for(j=1; j<=q; j++)
{
cin>>p>>x;
if(p==0)
{
st=1;
dr=n;
poz=-1;
while(st<dr)
{
m=(st+dr)/2;
if(v[m]==x) poz=m;
if(v[m]<=x) st=m+1;
else dr=m-1;
}
cout<<poz<<'\n';
}
else if(p==1)
{
st=1;
dr=n;
poz=-1;
while(st<dr)
{
m=(st+dr)/2;
if(v[m]<=x) poz=m;
if(v[m]<=x) st=m+1;
else dr=m-1;
}
cout<<poz<<'\n';
}
else
{
st=1;
dr=n;
poz=-1;
while(st<=dr)
{
m=(st+dr)/2;
if(v[m]>=x) poz=m;
if(v[m]<x) st=m+1;
else dr=m-1;
}
cout<<poz<<'\n';
}}
return 0;}