Cod sursa(job #3003310)
Utilizator | Data | 15 martie 2023 17:36:15 | |
---|---|---|---|
Problema | Cautare binara | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 1.41 kb |
#include <bits/stdc++.h>
using namespace std;
int v[100005];
int main()
{
ifstream cin("cautbin.in");
ofstream cout("cautbin.out");
int n, m, a, t, st, dr, mij, ans;
cin>>n;
for(int i=1; i<=n; i++)
cin>>v[i];
cin>>m;
for(int i=1; i<=m; i++)
{
cin>>t>>a;
st=1;dr=n;
if(t==0)
{
ans=-1;
while(st<=dr)
{
mij=(st+dr)/2;
if(v[mij]>a)
dr=mij-1;
else
{
st=mij+1;
ans=mij;
}
}
if(v[ans]!=a)cout<<"-1\n";
else cout<<ans<<'\n';
}
else if(t==1)
{
while(st<=dr)
{
mij=(st+dr)/2;
if(v[mij]>a)
dr=mij-1;
else
{
st=mij+1;
ans=mij;
}
}
cout<<ans<<'\n';
}
else
{
while(st<=dr)
{
mij=(st+dr)/2;
if(v[mij]<a)
st=mij+1;
else
{
dr=mij-1;
ans=mij;
}
}
cout<<ans<<'\n';
}
}
return 0;
}