Cod sursa(job #966814)
Utilizator | Data | 26 iunie 2013 16:42:04 | |
---|---|---|---|
Problema | Cautare binara | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 1.88 kb |
#include <iostream>
#include <cstdio>
using namespace std;
int v[100010],maxim=-1,maxim2,minim;
int main()
{
freopen("cautbin.in","r",stdin);
freopen("cautbin.out","w",stdout);
int i,n,m,st,dr;
cin>>n;
for(i=1;i<=n;i++)
cin>>v[i];
cin>>m;
while(m--)
{
int x,querry;
cin>>querry>>x;
st=1;
dr=n;
if(querry==0)
{
while(st<dr)
{
int mid=(st+dr)/2;
if(v[mid]==x)
{
if(maxim<mid)
{
maxim=mid;
st=mid+1;
}
}
else
if(x<v[mid])
dr=mid-1;
else
st=mid-1;
}
cout<<maxim<<"\n";
maxim=-1;
}
else
if(querry==1)
{
maxim2=-1;
while(st<dr)
{
int mid=(st+dr)/2;
if(v[mid]<=x)
{
if(maxim2<mid)
{
maxim2=mid;
st=mid+1;
}
}
else
if(x<v[mid])
dr=mid-1;
else
st=mid+1;
}
cout<<maxim2<<"\n";
}
else
{
minim=dr;
while(st<dr)
{
int mid=(st+dr)/2;
if(v[mid]>=x)
{
if(minim>mid)
{
minim=mid;
dr=mid-1;
}
}
else
if(x<v[mid])
dr=mid-1;
else
st=mid+1;
}
cout<<minim-1<<"\n";
}
}
return 0;
}