Cod sursa(job #2289104)
Utilizator | Data | 24 noiembrie 2018 11:11:55 | |
---|---|---|---|
Problema | Cautare binara | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 1.69 kb |
#include <iostream>
#include <fstream>
#include <cstring>
using namespace std;
ifstream fin("cautbin.in");
ofstream fout("cautbin.out");
int n, v[100001], t, x, m;
int main()
{
fin>>n;
for(int i=1;i<=n;i++)
fin>>v[i];
fin>>m;
for(int i=1;i<=m;i++)
{
fin>>t>>x;
if(t==0)
{
int st=1, dr=n, rasp=n+1, mij;
while(st<=dr)
{
mij=(st+dr)/2;
if(v[mij]>x)
{
dr=mij-1;
rasp=mij;
}
else
{
st=mij+1;
}
}
if(v[rasp-1]==x)
fout<<rasp-1<<"\n";
else
fout<<-1<<"\n";
}
if(t==1)
{
int st=1, dr=n, rasp=n+1, mij;
while(st<=dr)
{
mij=(st+dr)/2;
if(v[mij]>x)
{
rasp=mij;
dr=mij-1;
}
else
{
st=mij+1;
}
}
fout<<rasp-1<<"\n";
}
if(t==2)
{
int st=1, dr=n, mij, rasp=n+1;
while(st<=dr)
{
mij=(st+dr)/2;
if(v[mij]>=x)
{
rasp=mij;
dr=mij-1;
}
else
{
st=mij+1;
}
}
fout<<rasp<<"\n";
}
}
return 0;
}