Cod sursa(job #2279117)

Utilizator MirceaCozmaciucMircea-Vlad Cozmaciuc MirceaCozmaciuc Data 8 noiembrie 2018 22:27:33
Problema Cautare binara Scor 10
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 2.29 kb
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("cautbin.in");
ofstream g("cautbin.out");

int cautbin0(int v[100000], int st, int dr, int x)
{
    int m=(st+dr)/2;
    if(st!=dr)
    {
        if(v[m]<x)
            return cautbin0(v,m+1,dr,x);
        else if(v[m]>x)
            return cautbin0(v,st,m-1,x);
        else
        {
            while(v[m]==x)
                m++;
            return m-1;
        }
    }
    else if(v[st]==x)
    {
        while(v[st]==x)
            st++;

        return st-1;
 }   return -1;
}

int cautbin1(int v[100000], int st, int dr, int x)
{
    int m=(st+dr)/2;
    if(st<dr)
    {
        if(v[m]<x && v[m+1]>x)
            return m;
        else if(v[m]>x && v[m-1]<x)
            return m-1;
        else if(v[m]<x)
            return cautbin1(v,m+1,dr,x);
        else if(v[m]>x)
            return cautbin1(v,st,m-1,x);
        else if(v[m]==x)
        {
            while(v[m]==x)
                m++;
            return m-1;
        }
    }
    else if(v[st]==x)
    {while(v[st]==x)
    st++;
        return st-1;}
    else if(v[st]>x && v[st-1]<x)
        return st-1;
    else if(v[st]<x && v[st+1]>x)
        return st+1;
    return -1;
}
int cautbin2(int v[100000], int st, int dr, int x)
{
    int m=(st+dr)/2;
    if(st<dr)
    {
        if(v[m]>x && v[m-1]<x)
            return m;
        else if(v[m]<x && v[m+1]>x)
            return m+1;
        else if(v[m]<x)
            return cautbin2(v,m+1,dr,x);
        else if(v[m]>x)
            return cautbin2(v,st,m-1,x);
        else if(v[m]==x)
        {
            while(v[m]==x)
                m--;
            return m+1;
        }

    }
    else if(v[st]==x)

    {while(v[st]==x)
    st--;
    return st+1;
    }
    else if(v[st]<x && v[st-1]>x)
        return st-1;
    else if(v[st]>x && v[st+1]<x)
        return st+1;
    return -1;
}

int main()
{
    int n,m,v[100000],a,b;
    f>>n;
    for(int i=1; i<=n; i++)
        f>>v[i];
    f>>m;
    for(int i=1; i<=m; i++)
    {
        f>>a>>b;
        if(a==0)
            g<<cautbin0(v,1,n,b)<<endl;
        if(a==1)
            g<<cautbin1(v,1,n,b)<<endl;
        if(a==2)
            g<<cautbin2(v,1,n,b)<<endl;
    }
    return 0;
}