Cod sursa(job #2172418)

Utilizator 24601Dan Ban 24601 Data 15 martie 2018 16:24:48
Problema Cautare binara Scor 100
Compilator c Status done
Runda Arhiva educationala Marime 0.99 kb
#include <stdio.h>

#define SIZE 100000

static int v[SIZE];

static int cb(int x, int n)
{
    int mid, pos;

    for (mid = 1; mid < n; mid <<= 1)
        ;

    for (pos = 0; mid; mid >>= 1) {
        if (pos + mid < n && v[pos + mid] <= x) {
            pos += mid;
        }
    }

    return pos;
}

static int cb2(int x, int n)
{
    int mid, pos;

    for (mid = 1; mid < n; mid <<= 1)
        ;

    for (pos = n - 1; mid; mid >>= 1) {
        if (pos - mid >= 0 && v[pos - mid] >= x) {
            pos -= mid;
        }
    }

    return pos;
}

int main(void)
{
    int n, m, i, op, x, r;
    int (*f[3])(int, int) = {cb, cb, cb2};

    freopen("cautbin.in", "r", stdin);
    freopen("cautbin.out", "w", stdout);

    scanf("%d", &n);

    for (i = 0; i < n; i++) {
        scanf("%d", &v[i]);
    }

    scanf("%d", &m);

    while (m--) {
        scanf("%d %d", &op, &x);
        r = f[op](x, n);
        printf("%d\n", (op || v[r] == x) * (r + 1) + !(op || v[r] == x) * -1);
    }

    return 0;
}