Cod sursa(job #2198152)

Utilizator sofialospaSofia Lospa sofialospa Data 23 aprilie 2018 19:05:19
Problema Cautare binara Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 1.03 kb
#include <iostream>
#include <fstream>

using namespace std;

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

const int N = 100001;
const int L = 16;

int v[N], n;

int caut0 (int x)
{
    int r=0, pas=1<<L;
    while(pas!=0)
    {
        if(r+pas<=n && v[r+pas]<=x)
            r+=pas;
        pas/=2;
    }
    if(r==0 || v[r]<x)
    {
        r=-1;
    }
    return r;
}

int caut1(int x)
{
    int r=0, pas=1<<L;
    while(pas!=0)
    {
        if(r+pas<=n && v[r+pas]<=x)
            r+=pas;
        pas/=2;
    }
    return r;

}

int caut2 ( int x )
{
    int r=0, pas=1<<L;
    while(pas!=0)
    {
        if(r+pas<=n && !(v[r+pas]>=x))
            r+=pas;
        pas /= 2;
    }
    r++;
    return r;
}

int main()
{
    int m, i, t, tip, val;
    in>>n;
    for(i=1; i<=n; i++)
        in>>v[i];
    in>>m;
    for(i=0; i<m; i++)
    {
        in>>tip>>val;
        if(tip==0)
            t=caut0(val);
        else if(tip==1)
            t=caut1(val);
        else
            t=caut2(val);
        out<<t<<"\n";
    }
    return 0;
}