Cod sursa(job #2775905)
Utilizator | Data | 17 septembrie 2021 22:00:00 | |
---|---|---|---|
Problema | Cautare binara | Scor | 40 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 1.06 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin("cautbin.in");
ofstream fout("cautbin.out");
int main()
{ int m,c,a,n,v[100005],st,dr,mij;
fin>>n;
for(int i=1;i<=n;i++)
{
fin>>v[i];
}
fin>>m;
while(m)
{
fin>>c>>a;
if(c==0)
{
st=1;
dr=n+1;
while(dr-st>1)
{ mij=(dr+st)/2;
if(a<v[mij])
dr=mij;
else
st=mij;
}
if(v[st]==a)
fout<<st<<endl;
else
fout<<-1<<endl;
}
if(c==1)
{
st=1;
dr=n+1;
while(dr-st>1)
{ mij=(dr+st)/2;
if(a<v[mij])
dr=mij;
else
st=mij;
}
fout<<st<<endl;
}
if(c==2)
{
st=1;
dr=n+1;
while(dr-st>1)
{ mij=(dr+st)/2;
if(a<=v[mij])
dr=mij;
else
st=mij;
}
fout<<dr<<endl;
}
m--;
}
return 0;
}