Cod sursa(job #3254606)

Utilizator dianatheadiana thea udristoiu dianathea Data 8 noiembrie 2024 10:23:38
Problema Cautare binara Scor 0
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 1.75 kb
#include <iostream>
#include <fstream>
#include <algorithm>



using namespace std;
ifstream fin("cautbin.in");
ofstream fout("cautbin.out");

int cb0(int x,int v[],int n)
{
    int st=1;
    int dr=n;
    if(v[n]==x)
    {
        return n;
    }
    while(st<=dr)
    {
        int m=(st+dr)/2;
        if(v[m]==x && v[m+1]>x)
        {
            return m;
        }
        if(v[m]<x)
        {
            st=m+1;
        }
        else
        {
            dr=m-1;
        }
    }
    return -1;
}
int cb1(int x,int v[],int n)
{
    int st=1;
    int dr=n;
    if(v[n]<=x)
    {
        return n;
    }
    while(st<=dr)
    {
        int m=(st+dr)/2;
        if(v[m]<=x && v[m+1]==x)
        {
            return m;
        }
        if(v[m]<=x)
        {
            st=m+1;
        }
        else
        {
            dr=m-1;
        }
    }
    return 0;
}
int cb2(int x,int v[],int n)
{
    int st=1;
    int dr=n;
    if(v[n]>=x)
    {
        return n;
    }
    while(st<=dr)
    {
        int m=(st+dr)/2;
        if(v[m]>=x && v[m-1]<x)
        {
            return m;
        }
        if(v[m]<x)
        {
            st=m+1;
        }
        else
        {
            dr=m-1;
        }
    }
    return -1;
}
int main()
{
    int n;
    fin>>n;
    int v[n+1];
    for(int i=1;i<=n;i++)
    {
        fin>>v[i];
    }
    int t;
    fin>>t;
    int c,x;
    for(int i=1;i<=t;i++)
    {
        fin>>c>>x;
        if(c==0)
        {
            fout<<cb0(x,v,n)<<"\n";
        }
        if(c==1)
        {
            fout<<cb1(x,v,n)<<"\n";
        }
        if(c==2)
        {
            fout<<cb2(x,v,n)<<"\n";
        }
    }

    return 0;
}