Cod sursa(job #2258692)

Utilizator Cezar211Popoveniuc Cezar Cezar211 Data 11 octombrie 2018 20:28:16
Problema Cautare binara Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 1.47 kb
#include <iostream>
#include <fstream>
#define cout fout
#define NM 100005
using namespace std;
ifstream fin ("cautbin.in");
ofstream fout ("cautbin.out");
int cb0(int x);
int cb1(int x);
int cb2(int x);
int n, i, v[NM], m, cer, x;
int main()
{
    fin >> n;
    for(i=1; i<=n; i++)
        fin >> v[i];
    fin >> m;
    for(i=1; i<=m; i++)
    {
        fin >> cer >> x;
        if(cer == 0)
            cout << cb0(x) << '\n';
        else if(cer == 1)
            cout << cb1(x) << '\n';
        else cout << cb2(x) << '\n';
    }

    return 0;
}

int cb0(int x)
{
    int st = 1, dr = n, mijl;
    while(st<=dr)
    {
        mijl = (st+dr)/2;
        if(x == v[mijl])
        {
            int j;
            for(j=mijl; j<=n; j++)
                if(v[j]!=x)
                    break;
            return j-1;
        }
        else if(x < v[mijl])
            dr = mijl-1;
        else st = mijl+1;
    }
    return -1;
}

int cb1(int x)
{
    int st = 1, dr = n, poz;
    while(st<=dr)
    {
        int mijl = (st+dr)/2;
        if(x >= v[mijl])
        {
            poz = mijl;
            st = mijl+1;
        }
        else dr = mijl-1;
    }
    return poz;
}

int cb2(int x)
{
    int st = 1, dr = n, poz;
    while(st<=dr)
    {
        int mijl = (st+dr)/2;
        if(x<=v[mijl])
        {
            poz = mijl;
            dr = mijl-1;
        }
        else st = mijl+1;
    }
    return poz;
}