Cod sursa(job #3176724)

Utilizator doruliqueDoru MODRISAN dorulique Data 27 noiembrie 2023 17:44:26
Problema Cautare binara Scor 0
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 1.47 kb
#include <iostream>
#include<fstream>
using namespace std;
ifstream in("cautbin.in");
ofstream out("cautbin.out");
int n,a[100001],x,m,v[10001][3];
int cautare_binara_0(int x1)
{
    int li=1,lf=n,m1;
    m1=(li+lf)/2;
    while(li<=lf && a[m1]!=x1)
    {
        if(x<a[m1])
            lf=m1;
        else
            li=m1+1;
        m1=(li+lf)/2;
    }
    if(li<=lf)
        return m1;
    else return -1;
}
int cautare_binara_1(int x1)
{
    int li=1,lf=n,m1;
    m1=(li+lf)/2;
    while(li<=lf && a[m1]!=x1)
    {
        if(x<=a[m1])
            lf=m1;
        else
            li=m1+1;
        m1=(li+lf)/2;
    }
    if(li<=lf)
        return m1;
    else return -1;
}
int cautare_binara_2(int x1)
{
    int li=1,lf=n,m1;
    m1=(li+lf)/2;
    while(li<=lf && a[m1]!=x1)
    {
        if(x<a[m1])
            lf=m1-1;
        else
            li=m1+1;
        m1=(li+lf)/2;
    }
    if(li<=lf)
        return m1;
    else return -1;
}
int main()
{
    in>>n;
    for(int i=1; i<=n; i++)
        in>>a[i];
    in>>m;
    for(int i=1; i<=m; i++)
    {
        in>>v[i][1];
        in>>x;
        if(v[i][1]==0)
        {
            out<<cautare_binara_0(x);
            out<<'\n';
        }
        else  if(v[i][1]==1)
        {
            out<<cautare_binara_1(x);
            out<<'\n';
        }
        else
        {
            out<<cautare_binara_2(x);
            out<<'\n';
        }
    }
    return 0;
}