Cod sursa(job #1318566)
Utilizator | Data | 16 ianuarie 2015 09:34:32 | |
---|---|---|---|
Problema | Cautare binara | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 1.71 kb |
#include<fstream>
using namespace std;
ifstream fin("cautbin.in");
ofstream fout("cautbin.out");
int n,m,a[100009],nr,i,st,dr,mid,val;
int main()
{
fin>>n;
for(i=1;i<=n;i++)
{
fin>>a[i];
}
fin>>m;
for(i=1;i<=m;i++)
{
fin>>nr;
fin>>val;
if(nr==0)
{
st=1;
dr=n;
while(st<=dr)
{
mid=(st+dr)/2;
if(a[mid]<=val)
{
st=mid+1;
}
else
{
dr=mid-1;
}
}
if(a[dr]==val)
{
fout<<dr<<'\n';
}
else
{
fout<<-1<<'\n';
}
}
if(nr==1)
{
st=1;
dr=n;
while(st<=dr)
{
mid=(st+dr)/2;
if(a[mid]<=val)
{
st=mid+1;
}
else
{
dr=mid-1;
}
}
fout<<dr<<'\n';
}
if(nr==2)
{
st=1;
dr=n;
while(st<=dr)
{
mid=(st+dr)/2;
if(a[mid]<val)
{
st=mid+1;
}
else
{
dr=mid-1;
}
}
fout<<st<<'\n';
}
}
fin.close();
fout.close();
return 0;
}