Cod sursa(job #2333650)

Utilizator BungerNadejde George Bunger Data 1 februarie 2019 18:08:15
Problema Cautare binara Scor 100
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 1.59 kb
#include <bits/stdc++.h>

using namespace std;
ifstream fin ("cautbin.in");
ofstream fout ("cautbin.out");
const int NMAX=1e5+5;
int n,m,v[NMAX],q,x;
int cautbin0(int x )
{
    int st=1,dr=n,poz=-1;
    while(st<=dr)
    {
        int mij=st+(dr-st)/2;
        if(v[mij]==x)
        {
            poz=mij;
            st=mij+1;
        }
        else if(v[mij]<x)
        {
            st=mij+1;
        }
        else {
            dr=mij-1;
        }
    }
    return poz;
}
int cautbin1(int x )
{
    int st=1,dr=n,poz=-1;
    while(st<=dr)
    {
        int mij=st+(dr-st)/2;
        if(v[mij]==x)
        {
            poz=mij;
            st=mij+1;
        }
        else if(v[mij]<x)
        {
            st=mij+1;
            poz=max(poz,mij);
        }
        else {
            dr=mij-1;
        }
    }
    return poz;
}
int cautbin2(int x )
{
    int st=1,dr=n,poz=INT_MAX;
    while(st<=dr)
    {
        int mij=st+(dr-st)/2;
        if(v[mij]==x)
        {
            poz=mij;
            dr=mij-1;
        }
        else if(v[mij]<x)
        {
            st=mij+1;

        }
        else {
            dr=mij-1;
             poz=min(poz,mij);
        }
    }
    return poz;
}
int main()
{
    fin>>n;
    for(int i=1;i<=n;i++) fin>>v[i];
    fin>>m;
    for(int i=1;i<=m;i++)
    {
        fin>>q>>x;
        switch(q)
        {
            case 0: {fout<<cautbin0(x)<<'\n';break;}
            case 1: {fout<<cautbin1(x)<<'\n';break;}
            case 2: {fout<<cautbin2(x)<<'\n';break;}
        }
    }
    return 0;
}