Cod sursa(job #3204673)
Utilizator | Data | 17 februarie 2024 11:29:31 | |
---|---|---|---|
Problema | Cautare binara | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 1.41 kb |
#include <fstream>
using namespace std;
ifstream cin("cautbin.in");
ofstream cout("cautbin.out");
int n,v[200005],ras,m,a,b,st,dr,mij;
int main()
{
cin>>n;
for(int i=1;i<=n;i++)
cin>>v[i];
cin>>m;
for(int i=1;i<=m;i++)
{
cin>>a>>b;
st=1;
dr=n;
ras=-1;
if(a==0)
{
while(st<=dr)
{
mij=(st+dr)/2;
if(v[mij]==b)
{
ras=mij;
st=mij+1;
}
else if(b>v[mij])
st=mij+1;
else
dr=mij-1;
}
cout<<ras<<"\n";
}
else if(a==1)
{
while(st<=dr)
{
mij=(st+dr)/2;
if(v[mij]<=b)
{
ras=mij;
st=mij+1;
}
else
dr=mij-1;
}
cout<<ras<<"\n";
}
else
{
while(st<=dr)
{
mij=(st+dr)/2;
if(v[mij]>=b)
{
ras=mij;
dr=mij-1;
}
else
st=mij+1;
}
cout<<ras<<"\n";
}
}
return 0;
}