Cod sursa(job #1348017)

Utilizator QQQ1911Vodita Stefan QQQ1911 Data 19 februarie 2015 14:12:31
Problema Cautare binara Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 1.45 kb
#include <fstream>
using namespace std;
ifstream f("cautbin.in");
ofstream g("cautbin.out");
long n,m, a[100001],x,q;
void caut0(int x, int p, int u)
{
    int m;
    if(p<=u)
    {
        m=(u+p)/2;
        if(a[m]==x)
        {
            q=m;
            caut0(x,m+1,u);
        }
        else if(q==0)
        {
            if(a[m]<x) caut0(x,m+1,u);
            else caut0(x,p,m);
        }
    }
}
void caut1(int x, int p, int u)
{
    int m;
    if(p<=u)
    {
        m=(p+u)/2;
        if(a[m]<=x)
        {
            q=m;
            caut1(x,m+1,u);
        }
        else if(q==0)
        {
            caut1(x,p,m);
        }
    }
}
void caut2(int x, int p, int u)
{
    int m;
    if(p<=u)
    {
        m=(p+u)/2;
        if(a[m]>=x)
        {
            q=m;
            caut2(x,p,m);
        }
        else if(q==0)
        {
            caut2(x,m+1,u);
        }
    }
}
void cit()
{
    f>>n;
    int i,t;
    for(i=1; i<=n; i++)
        f>>a[i];
    f>>m;
    for(i=1; i<=m; i++)
    {
        f>>t>>x;
        q=0;
        if (t==0)
        {
            caut0(x,1,n);
            if(q) g<<q<<'\n';
            else g<<-1<<'\n';
        }
        else if(t==1)
        {
            caut1(x,1,n);
            g<<q<<'\n';
        }
        else if(t==2)
        {
            caut2(x,1,n);
            g<<q<<'\n';
        }
    }
}
int main()
{
    cit();
    return 0;
}