Pagini recente » Cod sursa (job #849522) | Cod sursa (job #3270684)
#include <bits/stdc++.h>
using namespace std;
ifstream fin("cautbin.in");
ofstream fout("cautbin.out");
int n, a[100001], q;
int CB1(int a[], int st, int dr, int x)
{
int p = -1, mij;
while(st <= dr)
{
int mij = (st + dr) / 2;
if(a[mij] == x)
{
p = mij;
st = mij + 1;
}
else if(a[mij] < x) st = mij + 1;
else dr = mij - 1;
}
return p;
}
int CB2(int a[], int st, int dr, int x)
{
int p = -1, mij;
while(st <= dr)
{
mij = (st + dr) / 2;
if(a[mij] <= x)
{
p = mij;
st = mij + 1;
}
else dr = mij - 1;
}
return p;
}
int CB3(int a[], int st, int dr, int x)
{
int p = -1, mij;
while(st <= dr)
{
mij = (st + dr) / 2;
if(a[mij] >= x)
{
p = mij;
dr = mij - 1;
}
else st = mij + 1;
}
return p;
}
int main()
{
int i, x, op;
fin >> n;
for(i = 1; i <= n; i++)
fin >> a[i];
fin >> q;
for(i = 1; i <= q; i++)
{
fin >> op >> x;
if(op == 0) fout << CB1(a, 1, n, x) << "\n";
else if(op == 1) fout << CB2(a, 1, n, x) << "\n";
else fout << CB3(a, 1, n, x) << "\n";
}
return 0;
}