Cod sursa(job #2681197)
Utilizator | Data | 5 decembrie 2020 09:48:04 | |
---|---|---|---|
Problema | Cautare binara | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 1.29 kb |
#include <fstream>
using namespace std;
ifstream in("cautbin.in");
ofstream out("cautbin.out");
int V[100001];
int main()
{
int n, m, st, dr, q, val, med, ans;
in>>n;
for(int i=1;i<=n;i++)
in>>V[i];
in>>m;
for(int i=1;i<=m;i++)
{
in>>q>>val;
st=0;
dr=n-1;
if(q==0)
{
while(st<=dr)
{
med=(st+dr)/2;
if(V[med]<=val)
{
ans=med;
st=med+1;
}
else
dr=med-1;
}
}
if(q==1)
{
while(st<=dr)
{
med=(st+dr)/2;
if(V[med]<=val)
{
ans=med;
st=med+1;
}
else
dr=med-1;
}
}
if(q==2)
{
while(st<=dr)
{
med=(st+dr)/2;
if(V[med]>=val)
{
ans=med;
dr=med-1;
}
else
st=med+1;
}
}
out<<ans<<'\n';
}
return 0;
}