Cod sursa(job #2420063)
Utilizator | Data | 10 mai 2019 13:47:33 | |
---|---|---|---|
Problema | Cautare binara | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 1.48 kb |
#include <bits/stdc++.h>
#define Dim 100008
using namespace std;
ifstream f("cautbin.in");
ofstream g("cautbin.out");
int N,M,a,b,V[Dim],st,dr,mij;
int main()
{
f>>N;
for(int i=1;i<=N;i++) f>>V[i];
f>>M;
for(int i=1;i<=M;i++)
{
f>>a>>b;
if(a==0)
{
st=1; dr=N;
int ans=-1;
while(st<=dr)
{
int mij=(st+dr)/2;
if(V[mij]==b) ans=mij;
if(V[mij]<=b) st=mij+1;
else dr=mij-1;
}
g<<ans<<'\n';
}
else
if(a==1)
{
st=1; dr=N;
int ans=-1;
while(st<=dr)
{
int mij=(st+dr)/2;
if(V[mij]<=b)
{
st=mij+1;
ans=mij;
}
else
{
dr=mij-1;
}
}
g<<ans<<'\n';
}
else
if(a==2)
{
st=1; dr=N;
int ans=-1;
while(st<=dr)
{
int mij=(st+dr)/2;
if(V[mij]<b)
{
st=mij+1;
}
else
{
ans=mij;
dr=mij-1;
}
}
g<<ans<<'\n';
}
}
return 0;
}