Cod sursa(job #2408646)

Utilizator DavidAA007Apostol David DavidAA007 Data 18 aprilie 2019 10:49:55
Problema Cautare binara Scor 0
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 1.44 kb
#include<fstream>
using namespace std;
ifstream fin("cautbin.in");
ofstream fout("cautbin.out");
int n,m,intrebare,y,i,vt[100005];
int caut0x(int x, int v[100005])
{
    int st=1,dr=n,mijloc=0,poz=0;
    while(st<=dr)
    {
        mijloc=(st+dr)/2;
        if(v[mijloc]<=x)
            st=mijloc+1;
        else
            dr=mijloc-1;
    }
    if(v[dr]==x)
        return dr;
    return -1;
}
int caut1x(int x, int v[100005])
{
    int st=1,dr=n,mijloc=0,poz=0;
    while(st<=dr)
    {
        mijloc=(st+dr)/2;
        if(x>=v[mijloc])
        {
            poz=mijloc;
            st=mijloc+1;
        }
        else
            dr=mijloc-1;
    }
    if(v[poz]==x)
        return poz;
    return -1;
}
int caut2x(int x, int v[100005])
{
    int st=1,dr=n,mijloc=0,poz=0;
    while(st<=dr)
    {
        mijloc=(st+dr)/2;
        if(x<=v[mijloc])
        {
            poz=mijloc;
            dr=mijloc-1;
        }
        else
            st=mijloc+1;
    }
    if(v[poz]==x)
        return poz;
    return -1;
}
int main()
{
    fin>>n;
    for(i=1;i<=n;i++)
        fin>>vt[i];
    fin>>m;
    for(i=1;i<=m;i++)
    {
        fin>>intrebare>>y;
        if(intrebare==0)
            fout<<caut0x(y,vt)<<"\n";
        if(intrebare==1)
            fout<<caut1x(y,vt)<<"\n";
        if(intrebare==2)
            fout<<caut2x(y,vt)<<"\n";
    }
    fin.close();
    fout.close();
    return 0;
}