Cod sursa(job #2677751)
Utilizator | Data | 27 noiembrie 2020 12:47:21 | |
---|---|---|---|
Problema | Cautare binara | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 1.36 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin("cautbin.in");
ofstream fout("cautbin.out");
int n,m;
int sir[100005];
int op,x;
int main()
{
fin>>n;
for(int i=1;i<=n;i++)
fin>>sir[i];
fin>>m;
while(m--)
{
fin>>op>>x;
int ans=0;
int st=1;
int dr=n+1;
if(op==0)
{
while(st<dr)
{
int mid=(st+dr)/2;
if(sir[mid]<=x)
{
st=mid+1;
ans=mid;
}
else
dr=mid;
}
if(sir[ans]!=x)
ans=-1;
}
else if(op==1)
{
while(st<dr)
{
int mid=(st+dr)/2;
if(sir[mid]<=x)
{
st=mid+1;
ans=mid;
}
else
dr=mid;
}
}
else
{
while(st<dr)
{
int mid=(st+dr)/2;
if(sir[mid]>=x)
{
dr=mid;
ans=mid;
}
else
st=mid+1;
}
}
fout<<ans<<"\n";
}
return 0;
}