Cod sursa(job #3238655)
Utilizator | Data | 28 iulie 2024 15:33:39 | |
---|---|---|---|
Problema | Cautare binara | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 1.5 kb |
#include <fstream>
using namespace std;
ifstream fin("cautbin.in");
ofstream fout("cautbin.out");
int n,m,v[100005],q,i,x,st,dr,mij,sol;
int main()
{
fin>>n;
for (i=1; i<=n; i++)
fin>>v[i];
fin>>q;
while (q)
{
fin>>i>>x;
st=1; dr=n; sol=0;
if (i==0)
{
while (st<=dr)
{
mij=(st+dr)>>1;
if (v[mij]>x)
dr=mij-1;
else
if (v[mij]<x)
st=mij+1;
else
if (v[mij]==x)
{
sol=mij;
st=mij+1;
}
}
if (sol==0)
fout<<-1<<"\n";
else
fout<<sol<<"\n";
}
if (i==1)
{
while (st<=dr)
{
mij=(st+dr)>>1;
if (v[mij]<=x)
{
sol=mij;
st=mij+1;
}
else
dr=mij-1;
}
fout<<sol<<"\n";
}
if (i==2)
{
while (st<=dr)
{
mij=(st+dr)>>1;
if (v[mij]>=x)
{
sol=mij;
dr=mij-1;
}
else
st=mij+1;
}
fout<<sol<<"\n";
}
q--;
}
return 0;
}