Cod sursa(job #3308061)
| Utilizator | Data | 23 august 2025 12:40:27 | |
|---|---|---|---|
| Problema | Cautare binara | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 1.55 kb |
#include <bits/stdc++.h>
using namespace std;
int v[100555];
int main()
{
ifstream cin("cautbin.in");
ofstream cout("cautbin.out");
int n,m,c,x;
cin>>n;
for(int i=1;i<=n;++i)
{
cin>>v[i];
}
cin>>m;
for(int i=1;i<=m;++i)
{
cin>>c>>x;
int st=1,dr=n,mij,in=-1;
if(c==0)
{
while(st<=dr)
{
mij=(st+dr)/2;
if(v[mij]<=x)
{
st=mij+1;
in=mij;
}
else
{
dr=mij-1;
}
}
if(v[in]!=x)
{
in=-1;
}
cout<<in<<"\n";
}
else if(c==1)
{
while(st<=dr)
{
mij=(st+dr)/2;
if(v[mij]<=x)
{
st=mij+1;
in=mij;
}
else
{
dr=mij-1;
}
}
cout<<in<<"\n";
}
else
{
while(st<=dr)
{
mij=(st+dr)/2;
if(v[mij]>=x)
{
dr=mij-1;
in=mij;
}
else
{
st=mij+1;
}
}
cout<<in<<"\n";
}
}
return 0;
}
