Cod sursa(job #1391244)
Utilizator | Data | 17 martie 2015 18:48:08 | |
---|---|---|---|
Problema | Cautare binara | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 1.5 kb |
#include <fstream>
using namespace std;
ifstream fin("cautbin.in");
ofstream fout("cautbin.out");
int n,v[100005],m,i,k,x,p1,p2,mij;
int main()
{
fin>>n;
for(i=1;i<=n;i++)
{
fin>>v[i];
}
fin>>m;
for(i=1;i<=m;i++)
{
fin>>k>>x;
if(k==0)
{
p1=1;
p2=n;
while(p1<=p2)
{
mij=p1+(p2-p1)/2;
if(x<v[mij])
{
p2=mij-1;
}
else
{
p1=mij+1;
}
}
//p1>p2
if(v[p2]!=x)fout<<"-1"<<"\n";
else fout<<p2<<"\n";
}
else if(k==1)
{
p1=1;
p2=n;
while(p1<=p2)
{
mij=p1+(p2-p1)/2;
if(x<v[mij])
{
p2=mij-1;
}
else
{
p1=mij+1;
}
}
fout<<p2<<"\n";
}
else
{
p1=1;
p2=n;
while(p1<=p2)
{
mij=p1+(p2-p1)/2;
if(x<=v[mij])
{
p2=mij-1;
}
else
{
p1=mij+1;
}
}
fout<<p1<<"\n";
}
}
return 0;
}