Cod sursa(job #1335680)

Utilizator GosulyGosuly Robert Gosuly Data 5 februarie 2015 20:11:40
Problema Cautare binara Scor 40
Compilator cpp Status done
Runda Arhiva educationala Marime 1.51 kb
#include <iostream>
#include <fstream>
using namespace std;
ifstream in("cautbin.in");
ofstream out("cautbin.out");
int n,v[100001];
void readArray(){
in>>n;
for(int i=1;i<=n;i++)
    in>>v[i];
}
int binary0 (int p, int u, int key) {
    int m;

    while (p <= u) {
        m = (p + u) / 2;
        if (v[m] <= key)
            p = m + 1;
        else
            u = m - 1;
    }
    m = (p + u) / 2;

    if (v[m] > key) m --;
    if (v[m] == key)
        return m;
    return -1;
}

int binary1 (int p, int u, int key) {
    int m, n = u;

    while (p < u){
        m = (p + u) / 2;
        if (v[m] <= key)
            p = m + 1;
        else
            u = m;
    }

    m = (p + u) / 2;
    if (v[m] > key)
       -- m;
    return m;
}

int binary2 (int p, int u, int key) {
    int m;

    while (p < u) {
        m = (p + u) / 2;
        if (v[m] < key)
            p = m + 1;
        else
            u = m;
    }

    m = (p + u) / 2;
    if (v[m] < key)
       ++ m;
    return m;
}

int main()
{
    readArray();
    int m,k,x;
    in>>m;
    for (int i=1;i<=m;i++)
    {
        in>>k>>x;

        switch (k){

            case 0:
                out<<binary0(1,n,x)<<endl;
                break;
            case 1:
                out<<binary1(1,n,x)<<endl;
                break;
            case 2:
                out<<binary2(1,n,x)<<endl;
                break;



        }
    }



    in.close();
    out.close();
    return 0;
}