Cod sursa(job #3151845)
Utilizator | Data | 23 septembrie 2023 00:17:50 | |
---|---|---|---|
Problema | Cautare binara | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 1.25 kb |
#include <fstream>
using namespace std;
ifstream cin("cautbin.in");
ofstream cout("cautbin.out");
int v[100001];
int main()
{
int n,i;
cin>>n;
for(i=1;i<=n;i++)
cin>>v[i];
int m,a,b,mij,poz,st,dr;
cin>>m;
while(m>0)
{
m--;
cin>>a>>b;
if(a<2)
{
st=1;
dr=n;
poz=0;
while(st<=dr)
{
mij=(st+dr)/2;
if(v[mij]<=b)
{
st=mij+1;
poz=mij;
}
else
dr=mij-1;
}
if(a==1)
cout<<poz;
else
if(v[poz]==b)
cout<<poz;
else
cout<<-1;
}
else
{
st=1;
dr=n;
poz=0;
while(st<=dr)
{
mij=(st+dr)/2;
if(v[mij]>=b)
{
dr=mij-1;
poz=mij;
}
else
st=mij+1;
}
cout<<poz;
}
cout<<'\n';
}
return 0;
}