Cod sursa(job #2045673)
Utilizator | Data | 22 octombrie 2017 18:42:27 | |
---|---|---|---|
Problema | Cautare binara | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 1.6 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("cautbin.in");
ofstream fout("cautbin.out");
int n,m,i,v[100002],ok,x,j,l,r,p;
int main()
{
fin>>n;
for(i=1;i<=n;i++)
{
fin>>v[i];
}
fin>>m;
for(i=1;i<=m;i++)
{
fin>>ok>>x;
if(ok==0)
{
l=1;
r=n;
while(l<=r)
{
p=(l+r)/2;
if(v[p]<=x)
{
l=p+1;
}
else
{
r=p-1;
}
}
if(v[r]==x)
{
fout<<r<<"\n";
}
else
{
fout<<"-1"<<"\n";
}
}
if(ok==1)
{
l=1;
r=n;
while(l<=r)
{
p=l+(r-l)/2;
if(v[p]<=x)
{
l=p+1;
}
else
{
r=p-1;
}
}
fout<<r<<"\n";
}
if(ok==2)
{
l=1;
r=n;
while(l<=r)
{
p=l+(r-l)/2;
if(x<=v[p])
{
r=p-1;
}
else
{
l=p+1;
}
}
fout<<l<<"\n";
}
}
fin.close();
fout.close();
return 0;
}