Cod sursa(job #1368006)

Utilizator eu3neuomManghiuc Teodor-Florin eu3neuom Data 2 martie 2015 12:55:01
Problema Cautare binara Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 1.61 kb
#include <iostream>
#include <fstream>

using namespace std;

ifstream f("cautbin.in");
ofstream g("cautbin.out");

const int NMax = 100005;
int v[NMax];
int n;

int cbin0(int val){
    int lo = 1;
    int hi = n;
    int pos = 1e9;
    while(lo <= hi){
        int mid = (lo + hi) / 2;
        if(v[mid] == val){
            pos = mid;
        }
        if(v[mid] <= val){
            lo = mid + 1;
        } else {
            hi = mid - 1;
        }
    }
    if(pos != 1e9){
        return pos;
    } else {
        return -1;
    }
}

int cbin1(int val){
    int lo = 1;
    int hi = n;
    int pos;
    while(lo <= hi){
        int mid = (lo + hi) / 2;
        if(v[mid] <= val){
            pos = mid;
        }
        if(v[mid] <= val){
            lo = mid + 1;
        } else {
            hi = mid - 1;
        }
    }
    return pos;
}

int cbin2(int val){
    int lo = 1;
    int hi = n;
    int pos;
    while(lo <= hi){
        int mid = (lo + hi) / 2;
        if(v[mid] >= val){
            pos = mid;
        }
        if(v[mid] < val){
            lo = mid + 1;
        } else {
            hi = mid - 1;
        }
    }
    return pos;
}

int main()
{
    int m;
    f >> n;
    for(int i = 1; i <= n; i++){
        f >> v[i];
    }
    f >> m;
    int p,val;
    for(int i = 1; i <= m; i++){
        f >> p >> val;
        if(p == 0){
            g << cbin0(val) << "\n";
        }
        if(p == 1){
            g << cbin1(val) << "\n";
        }
        if(p == 2){
            g << cbin2(val) << "\n";
        }
    }
    return 0;
}