Pagini recente » Cod sursa (job #2749516) | Cod sursa (job #864170) | Cod sursa (job #1208682) | Cod sursa (job #561127) | Cod sursa (job #2338128)
#include <bits/stdc++.h>
using namespace std;
ifstream in("cautbin.in");
ofstream out("cautbin.out");
long long v[100001];
int bin_0(int x, int st, int dr)
{
int mij,poz=-1;
while(st<=dr)
{
mij=(dr+st)/2;
if(v[mij]==x)
{
poz=mij;
st=mij+1;
}
else if(v[mij]<x)
st=mij+1;
else dr=mij-1;
}
return poz;
}
int bin_1(int x, int st, int dr)
{
if(x<v[1])
return 1;
if(x>=v[dr])
return dr;
int mij,poz;
while(st<=dr)
{
mij=(st+dr)/2;
if(v[mij] <= x)
{
poz=mij;
st=mij+1;
}
else
dr=mij-1;
}
return poz;
}
int bin_2(int x,int st, int dr)
{
if(x<=v[1])
return 1;
int mij,poz;
while(st<=dr)
{
mij=(st+dr)/2;
if(x<=v[mij])
{
poz=mij;
dr=mij-1;
}
else st=mij+1;
}
return poz;
}
int main()
{
int n,i,m,a,b;
in>>n;
for(i=1; i<=n; i++)
in>>v[i];
in>>m;
for(i=1; i<=m; i++)
{
in>>a>>b;
if(a==0)
out<<bin_0(b,1,n)<<'\n';
else if(a==1)
out<<bin_1(b,1,n)<<'\n';
else
out<<bin_2(b,1,n)<<'\n';
}
return 0;
}