Cod sursa(job #2364807)
Utilizator | Data | 4 martie 2019 10:55:01 | |
---|---|---|---|
Problema | Cautare binara | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 1.41 kb |
#include <fstream>
using namespace std;
ifstream fin("cautbin.in");
ofstream fout("cautbin.out");
int n,m,st,dr,mij,v[100000],c,x,i,aux0,aux1,aux2;
int main()
{
fin>>n;
for(i=1; i<=n; i++)
fin>>v[i];
fin>>m;
for(i=1; i<=m; i++)
{
fin>>c>>x;
st=1;
dr=n;
aux0=aux1=aux2=-1;
if(c==0)
{
while(st<=dr)
{
mij=(st+dr)/2;
if(v[mij]==x)
{
aux0=mij;
st=mij+1;
}
else if(v[mij]>x)
dr=mij-1;
else
st=mij+1;
}
fout<<aux0<<'\n';
}
else if(c==1)
{
while(st<=dr)
{
mij=(st+dr)/2;
if (v[mij]<=x)
{
aux1=mij;
st=mij+1;
}
else dr=mij-1;
}
fout<<aux1<<'\n';
}
else
{
while(st<=dr)
{
mij=(st+dr)/2;
if (v[mij]>=x)
{
aux2=mij;
dr=mij-1;
}
else st=mij+1;
}
fout<<aux2<<'\n';
}
}
return 0;
}