Cod sursa(job #2502962)
Utilizator | Data | 1 decembrie 2019 22:45:19 | |
---|---|---|---|
Problema | Cautare binara | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 1.78 kb |
#include <fstream>
using namespace std;
ifstream cin("cautbin.in");
ofstream cout("cautbin.out");
long long a[100100],n,m,i,dr,st,g,mij,x,y;
int main()
{
cin>>n;
for(i=1;i<=n;i++)
cin>>a[i];
cin>>m;
for(i=1;i<=m;i++)
{
cin>>x>>y;
if(x==0)
{
st=1;
dr=n;
g=0;
while(st<=dr&&g==0)
{
mij=(st+dr)/2;
if(a[mij]==y&&(a[mij+1]!=y||mij==n))
{
g=1;
cout<<mij<<"\n";
}
else
st=mij+1;
}
if(g==0)
cout<<-1<<"\n";
}
if(x==1)
{
st=1;
dr=n;
g=0;
while(st<=dr&&g==0)
{
mij=(st+dr)/2;
if(a[mij]<=y&&(a[mij+1]>y||mij==n))
{
g=1;
cout<<mij<<"\n";
}
else
st=mij+1;
if(a[i]<=y)
st=mij+1;
else
dr=mij-1;
}
}
if(x==2)
{
st=0;
dr=n;
g=0;
while(st<=dr&&g==0)
{
mij=(st+dr)/2;
if(a[mij]>=y&&(a[mij-1]<y||mij==1))
{
g=1;
cout<<mij<<"\n";
}
else
dr=mij-1;
if(a[i]>=y)
dr=mij-1;
else
st=mij+1;
}
}
}
return 0;
}