Pagini recente » Cod sursa (job #2110576) | Cod sursa (job #1624225) | Cod sursa (job #900755) | Cod sursa (job #2901683) | Cod sursa (job #2203833)
#include <cstdio>
int v[100010];
int c0 (int dr, int key) {
int m,st=1;
while (st <= dr) {
m = (st + dr) / 2;
if (v[m] <= key)
st = m + 1;
else
dr = m - 1;
}
m = (st + dr) / 2;
if (v[m] > key) m --;
if (v[m] == key)
return m;
return -1;
}
int c1 ( int dr, int key) {
int m, n = dr,st=1;
while (st < dr){
m = (st + dr) / 2;
if (v[m] <= key)
st = m + 1;
else
dr = m;
}
m = (st + dr) / 2;
if (v[m] > key)
m--;
return m;
}
int c2 (int dr, int key) {
int m,st=1;
while (st < dr) {
m = (st + dr) / 2;
if (v[m] < key)
st = m + 1;
else
dr = m;
}
m = (st + dr) / 2;
if (v[m] < key)
m++;
return m;
}
int main () {
int i, n, m, tip, val;
freopen("cautbin.in","r",stdin);
freopen("cautbin.out","w",stdout);
scanf("%d", &n);
for (i = 1; i <= n; ++ i)
scanf("%d", &v[i]);
scanf("%d", &m);
while (m --){
scanf("%d%d", &tip, &val);
if (tip == 0)
printf("%d\n", c0( n, val));
if (tip == 1)
printf("%d\n", c1(n, val));
if (tip == 2)
printf("%d\n", c2(n, val));
}
}