Cod sursa(job #2046505)
Utilizator | Data | 23 octombrie 2017 20:54:05 | |
---|---|---|---|
Problema | Cautare binara | Scor | 10 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 2.45 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("cautbin.in");
ofstream g("cautbin.out");
int n,m,i,x,v[100002],c,r,l,ok;
void citire()
{
f>>n;
for(i=1;i<=n;i++)
{
f>>v[i];
}
f>>m;
}
int main()
{
citire();
l=1;
r=n;
ok=0;
for(int k=1;k<=m;k++)
{
f>>c>>x;
if(c==0)
{
int mij;
while(l<=r&&ok==0)
{
mij=l+(r-l)/2;
if(v[mij]==x)
{
if(mij==r||v[mij+1]>x)
{
g<<mij<<"\n";
ok=1;
}
else
{
l=mij+1;
}
}
else
{
if(v[mij]>x)
r=mij-1;
else
l=mij+1;
}
}
if(ok==0)
g<<-1<<"\n";
}
ok=0;
l=1;
r=n;
if(c==1)
{
int mij;
while(l<=r&ok==0)
{
mij=l+(r-l)/2;
if(v[mij]<=x)
{
if(mij==r||v[mij+1]>x)
{
ok=1;
g<<mij<<"\n";
}
else
{
l=mij+1;
}
}
else
r=mij-1;
}
if(ok==0)
g<<mij<<"\n";
}
ok=0;
l=1;
r=n;
if(c==2)
{
int mij;
while(l<=r&&ok==0)
{
mij=l+(r-l)/2;
if(v[mij]>=x)
{
if(mij==l||v[mij-1]<x)
{
ok=1;
g<<mij<<"\n";
}
else
{
r=mij-1;
}
}
else
{
if(v[mij]>x)
r=mij-1;
else
l=mij+1;
}
}
if(ok==0)
g<<mij<<"\n";
}
}
return 0;
}