Cod sursa(job #2678893)
Utilizator | Data | 28 noiembrie 2020 22:39:37 | |
---|---|---|---|
Problema | Cautare binara | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 1.47 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin ("cautbin.in");
ofstream fout ("cautbin.out");
int n,i,q,t,x;
int st,dr,mij,last;
int v[100005];
int main()
{
fin>>n;
for(i=1;i<=n;i++)
fin>>v[i];
fin>>q;
while(q)
{
q--;
fin>>t>>x;
st=1;
dr=n;
last=-1;
if(t==0)
{
while(st<=dr)
{
mij=(st+dr)/2;
if(v[mij]==x)
{
last=mij;
st=mij+1;
}
if(v[mij]<x)
st=mij+1;
if(v[mij]>x)
dr=mij-1;
}
}
if(t==1)
{
while(st<=dr)
{
mij=(st+dr)/2;
if(v[mij]<=x)
{
last=mij;
st=mij+1;
}
else
{
dr=mij-1;
}
}
}
if(t==2)
{
while(st<=dr)
{
mij=(st+dr)/2;
if(v[mij]>=x)
{
last=mij;
dr=mij-1;
}
else
{
st=mij+1;
}
}
}
fout<<last<<'\n';
}
return 0;
}