Cod sursa(job #2282820)
Utilizator | Data | 14 noiembrie 2018 15:43:22 | |
---|---|---|---|
Problema | Cautare binara | Scor | 40 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 1.77 kb |
#include <bits/stdc++.h>
using namespace std;
const int N=100000+5;
int n;
int v[N];
int main()
{
freopen("cautbin.in","r",stdin);
freopen("cautbin.out","w",stdout);
cin>>n;
for(int i=1;i<=n;i++)
{
cin>>v[i];
}
int q;
cin>>q;
while(q--)
{
int t,x;
cin>>t>>x;
if(t==0)
{
int st=1;
int dr=n;
int ans=-1;
while(st<=dr)
{
int med=(st+dr)/2;
if(v[med]==x)
{
ans=med;
}
if(v[med]<=x)
{
st=med+1;
}
else
{
dr=med-1;
}
}
cout<<ans<<"\n";
}
if(t==1)
{
int st=1;
int dr=n;
int ans=-1;
while(st<=dr)
{
int med=(st+dr)/2;
if(v[med]<=x)
{
ans=med;
st=med+1;
}
else
{
dr=med-1;
}
}
cout<<ans<<"\n";
}
if(t==2)
{
int st=1;
int dr=n;
int ans=-1;
while(st<=dr)
{
int med=(st+dr)/2;
if(v[med]>=x)
{
ans=med;
dr=med-1;
}
else
{
st=med+1;
}
}
cout<<ans<<"\n";
}
}
return 0;
}