Pagini recente » Cod sursa (job #1150240) | Cod sursa (job #3232647) | Cod sursa (job #1242222) | Cod sursa (job #3189514) | Cod sursa (job #2657443)
#include <iostream>
#include <fstream>
using namespace std;
ifstream in ("cautbin.in");
ofstream out ("cautbin.out");
const int NMAX=100005;
int n,m,a[NMAX];
void caut0 (int x)
{
int st=1,dr=n,mij,sol=-1;
while(st<=dr)
{
mij=(st+dr)/2;
if(a[mij]>x){
dr=mij-1;
}
else if(x>a[mij])
st=mij+1;
else
{
sol=mij;
st=mij+1;
}
}
out<<sol<<'\n';
}
void caut1 (int x)
{
int st=1,dr=n,mij,sol=1;
while(st<=dr)
{
mij=(st+dr)/2;
if(a[mij]>x){
dr=mij-1;
}
else
{
sol=mij;
st=mij+1;
}
}
out<<sol<<'\n';
}
void caut2 (int x)
{
int st=1,dr=n,mij,sol=1;
while(st<=dr)
{
mij=(st+dr)/2;
if(a[mij]<x){
st=mij+1;
}
else
{
sol=mij;
dr=mij-1;
}
}
out<<sol<<'\n';
}
int main()
{
in>>n;
int tip,x;
for(int i=1;i<=n;i++){
in>>a[i];
}
in>>m;
while(m--){
in>>tip>>x;
if(tip==0){
caut0(x);
}
else if(tip==1){
caut1(x);
}
else
caut2(x);
}
return 0;
}