Cod sursa(job #1892940)
Utilizator | Data | 25 februarie 2017 13:24:37 | |
---|---|---|---|
Problema | Cautare binara | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 1.73 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("cautbin.in");
ofstream fout("cautbin.out");
int v[100002],n,m,M,i,j,p1,p2,q,k,x;
int main()
{
fin>>n;
for(i=1;i<=n;i++)
{
fin>>v[i];
}
fin>>m;
for(i=1;i<=m;i++)
{
fin>>M;
fin>>x;
if(M==0)
{
p1=1;
p2=n;
k=-1;
while(p1 <= p2 && k==-1)
{
q=p1+(p2-p1)/2;
if(x>=v[q])
{
p1=q+1;
}
else
{
p2=q-1;
}
}
if(v[p2]==x)
{
fout<<p2<<"\n";
}
else
{
fout<<-1<<"\n";
}
}
if(M==1)
{
p1=1;
p2=n;
k=-1;
while(p1 <= p2 && k==-1)
{
q=p1+(p2-p1)/2;
if(x>=v[q])
{
p1=q+1;
}
else
{
p2=q-1;
}
}
fout<<p2<<"\n";
}
if(M==2)
{
p1=1;
p2=n;
k=-1;
while(p1 <= p2 && k==-1)
{
q=p1+(p2-p1)/2;
if(x>v[q])
{
p1=q+1;
}
else
{
p2=q-1;
}
}
fout<<p1<<"\n";
}
}
fin.close();
fout.close();
return 0;
}