Cod sursa(job #982460)

Utilizator classiusCobuz Andrei classius Data 9 august 2013 11:55:20
Problema Cautare binara Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 1.16 kb
#include <fstream>
#include <cmath>

using namespace std;

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

int v[100010];

int bin_1(int i,int j,int x)
{
    int m=(i+j)/2;

    if(i==j&&v[i]!=x)
        return -1;

    if(v[m]==x&&v[m+1]!=x)
        return m;

    if(v[m]<=x) return bin_1(m+1,j,x);
    else return bin_1(i,m,x);

}

int bin_2(int i,int j,int x)
{
    int m=(i+j)/2;

    if(x>=v[m]&&(!v[m+1]||v[m+1]>x))
        return m;

    if(v[m]>x) return bin_2(i,m,x);
    else return bin_2(m+1,j,x);
}

int bin_3(int i,int j,int x)
{
    int m=(i+j)/2;

    if(x<=v[m]&&(!v[m-1]||v[m-1]<x))
        return m;

    if(v[m]>=x) return bin_3(i,m,x);
    else return bin_3(m+1,j,x);
}

int main()
{
    int n,m;
    f>>n;
    for(int i=1;i<=n;i++)
        f>>v[i];
    f>>m;
    for(int i=1;i<=m;i++){
        int cd,x;
        f>>cd>>x;
        switch(cd){
            case 0:
                if(v[1]>x||v[n]<x){
                    g<<-1<<'\n';
                    break;
                }
                g<<bin_1(1,n,x)<<'\n'; break;

            case 1: g<<bin_2(1,n,x)<<'\n';break;

            case 2: g<<bin_3(1,n,x)<<'\n';break;

        }
    }


    return 0;
}