Pagini recente » Cod sursa (job #2164427) | Cod sursa (job #1919709) | Cod sursa (job #1891170) | Cod sursa (job #1804633) | Cod sursa (job #1519453)
#include <fstream>
using namespace std;
int n, m, x, mid, st, dr, i, v[100001], a, p=0, q=0, b, pam ;
ifstream fin("cautbin.in");
ofstream fout("cautbin.out");
int main(){
fin>>n;
for(i=1;i<=n;i++)
fin>>v[i];
fin>>m;
for(i=1;i<=m;i++){
fin>>a>>x;
if (a == 0) {
st = 1;
dr = n;
while (st <= dr) {
mid = (st + dr)/2;
if (v[mid] <= x)
st = mid+1;
else
dr = mid-1;
}
if (v[dr] == x)
fout << dr <<"\n";
else
fout<<"-1\n";
}
if(a==1){
st=1;
dr=n;
while(st<=dr){
mid=(st+dr)/2;
if(v[mid]<=x)
st=mid+1;
else
dr=mid-1;
}
fout<<dr<<"\n";
}
if(a==2){
st=1;
dr=n;
while(st<=dr){
mid=(st+dr)/2;
if(v[mid]>=x)
dr=mid-1;
else
st=mid+1;
}
fout<<st<<"\n";
}
}
return 0;
}