Cod sursa(job #2608991)

Utilizator Mari_BarbuBarbu Mariana Mari_Barbu Data 1 mai 2020 23:49:36
Problema Cautare binara Scor 100
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 1.74 kb
#include <iostream>
#include<fstream>
using namespace std;
ifstream f("cautbin.in");
ofstream g("cautbin.out");
int v[100001],n;
int CautareBinara0(int left, int right, int x)
{
    if(left>right)
        return -1;
    else
    {

        int mid=(left+right)/2;
        if(x==v[mid])
            if(x==v[mid+1])
                return CautareBinara0(mid+1, right, x);
            else
                return mid;
        if(x<v[mid])
            return CautareBinara0(left, mid-1, x);
        else
            return CautareBinara0(mid+1, right, x);
    }
}

int CautareBinara1(int left, int right, int x)
{
    if(left>right)
        return -1;
    int mid=(left+right)/2;
        if(x>=v[mid])
            if(x<v[mid+1]||mid==n)
                return mid;
            else
               return CautareBinara1(mid+1, right, x);
        else
            return CautareBinara1(left, mid-1, x);
}



int CautareBinara2(int left, int right, int x)
{
    if(left>right)
        return -1;
    int mid=(left+right)/2;
        if(x<=v[mid])
            if(x>v[mid-1]||mid==1)
                return mid;
            else
               return CautareBinara2(left, mid-1, x);
        else
            return CautareBinara2(mid+1,right, x);
}
int main()
{
    int m,x,y;
    f>>n;
    for(int i=1;i<=n;i++)
        f>>v[i];
    f>>m;
    for(int j=0;j<m;j++)
    {
        f>>y;
        if(y==0)
        {
            f>>x;
            g<<CautareBinara0(1,n,x)<<'\n';
        }
        if(y==1)
        {
            f>>x;
            g<<CautareBinara1(1,n,x)<<'\n';
        }
        if(y==2)
        {
            f>>x;
            g<<CautareBinara2(1,n,x)<<'\n';
        }

    }
    return 0;
}