Pagini recente » Cod sursa (job #1111658) | Cod sursa (job #1767357) | Cod sursa (job #2538882) | Cod sursa (job #3003007) | Cod sursa (job #3031382)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("cautbin.in");
ofstream fout("cautbin.out");
int v[100005];
int binsearch(int st, int dr, int val)
{
int ans=-1;
while(st<=dr)
{
int med=(st+dr)/2;
if(v[med]<=val)
{
st=med+1;
ans=med;
}
else
{
dr=med-1;
}
}
return ans;
}
int binsearch_peinvers(int st, int dr, int val)
{
int ans=-1;
while(st<=dr)
{
int med=(st+dr)/2;
if(v[med]>=val)
{
dr=med-1;
ans=med;
}
else
{
st=med+1;
}
}
return ans;
}
int main()
{
int n,m,x,cer;
fin>>n;
for(int i=1;i<=n;i++)
fin>>v[i];
fin>>m;
for(int i=1;i<=m;i++)
{
int ok=0;
fin>>cer>>x;
if(cer==0)
{ int r=binsearch(1,n,x);
if(v[r]!=x)
fout<<-1<<'\n';
else
fout<<binsearch(1,n,x)<<'\n';
}
else if(cer==1)
{
fout<<binsearch(1,n,x)<<'\n';
}
else
fout<<binsearch_peinvers(1,n,x)<<'\n';
}
return 0;
}