Pagini recente » Cod sursa (job #993012) | Cod sursa (job #803032) | Cod sursa (job #967994) | Cod sursa (job #3286425) | Cod sursa (job #3139252)
#include <bits/stdc++.h>
using namespace std;
ifstream fin("cautbin.in");
ofstream fout("cautbin.out");
const int NMAX=100000;
int v[NMAX+1];
int main()
{
int n,m,c,x;
fin>>n;
for(int i=1;i<=n;i++){
fin>>v[i];
}
fin>>m;
for(int i=1;i<=m;i++){
fin>>c>>x;
if(c==0){
int st = 1, dr = n, mid, sol=-1;
while (st <= dr) {
mid = (st + dr) / 2;
if (v[mid] == x) sol=mid,st=mid+1;
else if(v[mid]<x) st=mid+1;
else dr=mid-1;
}
fout<<sol<<'\n';
}
if(c==1){
int st = 1, dr = n, mid, sol=-1;
while (st <= dr) {
mid = (st + dr) / 2;
if (v[mid] <= x) sol=mid,st=mid+1;
else dr=mid-1;
}
fout<<sol<<'\n';
}
if(c==2){
int st = 1, dr = n, mid, sol=-1;
while (st <= dr) {
mid = (st + dr) / 2;
if (v[mid] >= x) sol=mid,dr=mid-1;
else st=mid+1;
}
fout<<sol<<'\n';
}
}
return 0;
}