Cod sursa(job #2081880)

Utilizator efinagAdina Grecu efinag Data 5 decembrie 2017 11:57:08
Problema Cautare binara Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 1.1 kb
#include <fstream>

using namespace std;

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

int v[N],n;

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

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

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

int main()
{
    ifstream in("cautbin.in");
    ofstream out("cautbin.out");
    int x,m,tip;
    in>>n;
    for(int i=1;i<=n;i++)
    {
        in>>v[i];
    }
    in>>m;
    for(int i=0;i<m;i++)
    {
        in>>tip>>x;
        if (tip == 0)
        {
            out<<functie0(x)<<"\n";
        }
        if (tip == 1)
        {
            out<<functie1(x)<<"\n";
        }
        if (tip == 2)
        {
            out<<functie2(x)<<"\n";
        }
    }
    return 0;
}