Pagini recente » Cod sursa (job #136305) | Cod sursa (job #2310818) | Cod sursa (job #2735055) | Cod sursa (job #3144225) | Cod sursa (job #2190173)
#include <bits/stdc++.h>
using namespace std;
ifstream fin("cautbin.in");
ofstream fout("cautbin.out");
int n, m, v[100002], st, dr;
void unu(int x)
{
int mijl;
while(st<=dr)
{
mijl=st+(dr-st)/2;
if(v[mijl]<=x)
{
st=mijl+1;
}
else
dr=mijl-1;
}
if(v[st-1]==x)
fout<<st-1<<"\n";
else
fout<<"-1"<<"\n";
}
void doi(int x)
{
int mijl;
while(st<=dr)
{
mijl=st+(dr-st)/2;
if(v[mijl]<=x)
st=mijl+1;
else dr=mijl-1;
}
fout<<dr<<'\n';
}
void trei(int x)
{
int mijl;
while(st<=dr)
{
mijl=st+(dr-st)/2;
if(v[mijl]>=x)
dr=mijl-1;
else st=mijl+1;
}
fout<<st<<'\n';
}
int main()
{
int i, p, x;
fin>>n;
for(i=1; i<=n; i++) fin>>v[i];
fin>>m;
for(i=1; i<=m; i++)
{
fin>>p>>x;
st=1;
dr=n;
if(p==0) unu(x);
else if(p==1) doi(x);
else trei(x);
}
return 0;
}