Cod sursa(job #1131638)

Utilizator alexteStefanescu Alexandru Catalin alexte Data 28 februarie 2014 22:45:33
Problema Cautare binara Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 1.73 kb
#include <fstream>
using namespace std;
int n,x[100003],i,a,b,m,t;
int cautbinzero(int x[], int n,int a)
{
    int p,q,m,r;
    p=1;
    q=n;
    r=-1;
    while(p<=q)
    {
        m=(p+q)/2;
        if(x[m]==a)
        {
            r=m;
            p=m+1;
        }
        else
            if(x[m]>a)
                {
                    q=m-1;
                }
            else
                {
                    p=m+1;
                }
    }
    return r;
}
int cautbinunu(int x[], int n,int a)
{
    int p,q,m,r;
    p=1;
    q=n;
    r=-1;
    while(p<=q)
    {
        m=(p+q)/2;
        if(x[m]<=a)
        {
            r=m;
            p=m+1;
        }
        else
            if(x[m]>a)
                {
                    q=m-1;
                }
            else
                {
                    p=m+1;
                }
    }
    return r;
}
int cautbindoi(int x[], int n,int a)
{
    int p,q,m,r;
    p=1;
    q=n;
    r=-1;
    while(p<=q)
    {
        m=(p+q)/2;
        if(x[m]>=a)
        {
            r=m;
            q=m-1;
        }
        else
            if(x[m]>a)
                {
                    q=m-1;
                }
            else
                {
                    p=m+1;
                }
    }
    return r;
}

int main()
{
    ifstream fin("cautbin.in");
    ofstream fout("cautbin.out");
    fin>>n;
    for(i=1;i<=n;i++)
        fin>>x[i];
    fin>>m;
    for(i=1;i<=m;i++)
    {
        fin>>a>>b;
        if(a==0)
            t=cautbinzero(x,n,b);
        else
            if(a==1)
                t=cautbinunu(x,n,b);
            else
                t=cautbindoi(x,n,b);
        fout<<t<<"\n";
    }
}