Cod sursa(job #900353)

Utilizator paul.mihaitaMihaita Paul paul.mihaita Data 28 februarie 2013 19:14:30
Problema Cautare binara Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 1.72 kb
#include <fstream>
using namespace std;
ifstream fin("cautbin.in");
ofstream fout("cautbin.out");
int m,v[100000],i,n,intr,mij,trb;
int cautare_binara0(int x)
{
    int st,dr,m,j;
    st=0;
    dr=n+1;
    m=0;
    while(st<dr&&v[m]!=x)
    {
        m=st+(dr-st)/2;
        if(v[m]>x)
            st=m+1;
        else
            dr=m-1;
    }
    if(v[m]!=x)
        return -1;
    else
    {
        j=m;
        while(v[j]==v[m])
            m++;
        return m-1;
    }
}
int cautare_binara1(int x)
{
    int st,dr,m,j;
    st=0;
    dr=n+1;
    m=0;
    while(st<dr&&v[m]!=x)
    {
        m=st+(dr-st)/2;
        if(v[m]>x)
            st=m+1;
        else
            dr=m-1;
    }
    if(v[m]!=x)
    {
        while(v[m]>x)
            m--;
        return m-1;
    }
    else
    {
        j=m;
        while(v[j]==v[m])
            m++;
        return m-1;
    }
}
int cautare_binara2(int x)
{
    int st,dr,m,j;
    st=0;
    dr=n+1;
    m=0;
    while(st<dr&&v[m]!=x)
    {
        m=st+(dr-st)/2;
        if(v[m]>x)
            st=m+1;
        else
            dr=m-1;
    }
    if(v[m]!=x)
    {
        while(v[m]<x)
            m++;
        return m;
    }
    else
    {
        j=m;
        while(v[j]==v[m])
            m--;
        return m+1;
    }
}
int main()
{
    fin>>n;
    for(i=1;i<=n;i++)
        fin>>v[i];
    fin>>m;
    for(i=1;i<=m;i++)
    {
        int j;
        fin>>trb;
        fin>>intr;
        if(trb==0)
            fout<<cautare_binara0(intr)<<'\n';
        if(trb==1)
            fout<<cautare_binara1(intr)<<'\n';
        if(trb==2)
            fout<<cautare_binara2(intr)<<'\n';
    }
    return 0;
}