Cod sursa(job #2046527)

Utilizator BirouRaresBirou Rares Gabriel BirouRares Data 23 octombrie 2017 21:18:26
Problema Cautare binara Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 2.1 kb
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("cautbin.in");
ofstream g("cautbin.out");
int n,m,i,v[100002],c,r,l,ok,p,u;
int cit(int l,int r, int x)
{
    int mij;
            while(l<=r)
            {
                mij=l+(r-l)/2;
                if(v[mij]==x)
                {
                    if(mij==r||v[mij+1]>x)
                    {
                       return mij;
                    }
                    else
                    {
                        l=mij+1;
                    }
                }
                else
                {
                    if(v[mij]>x)
                    r=mij-1;
                    else
                    l=mij+1;
                }
            }
            return -1;
}
int cit1(int l,int r, int x)
{
    int mij;
    while(l<=r)
            {
                mij=l+(r-l)/2;
                if(v[mij]<=x)
                {
                    if(mij==r||v[mij+1]>x)
                    {
                        return mij;
                    }
                    else
                    {
                        l=mij+1;
                    }
                }
                else
                r=mij-1;
            }
            return mij;
}
int cit2(int l,int r, int x)
{
    int mij;
            while(l<=r)
            {
                mij=l+(r-l)/2;
                if(v[mij]>=x)
                {
                    if(mij==l||v[mij-1]<x)
                    {
                        return mij;
                    }
                    else
                    {
                        r=mij-1;
                    }
                }
                else
                {
                        l=mij+1;
                }
            }

            return mij;
}
int main()
{
    f>>n;
    for(i=1;i<=n;i++)
    {
        f>>v[i];
    }
    f>>m;
    for(i=1;i<=m;i++)
    {
        f>>p>>u;
        if(p==0)  g<<cit(1,n,u)<<"\n";

        if(p==1) g<<cit1(1,n,u)<<"\n";

        if(p==2)  g<<cit2(1,n,u)<<"\n";
    }
    return 0;
}