Cod sursa(job #2968490)

Utilizator MBMihailBodnarciuc Mihail Enoh MBMihail Data 21 ianuarie 2023 11:49:46
Problema Cautare binara Scor 0
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 2.31 kb
#include <fstream>
#include <iostream>
using namespace std;
ifstream in("cautbin.in");
ofstream out("cautbin.out");
int main()
{
    int n,m,M,v[100001],i;
    in>>M;
    for(i=1; i<=M; i++)
    {
        in>>v[i];
    }
    int st=1;
    int dr=M;
    in>>n;
    int intrebare,val;
    for(i=1; i<=n; i++)
    {
        cin>>intrebare;
        cin>>val;
        if(intrebare==0)
        {
            st=1;
            dr=M;
            int pmax=-1;
            while(st<=dr)
            {
                int m=(st+dr)/2;
                if(v[m]<val)
                {
                    st=m+1;
                }
                else if(v[m]>val)
                {
                    dr=m-1;
                }
                else if(v[m]==val)
                {
                    while(v[m]==val)
                    {
                        m=m+1;
                    }
                    pmax=m-1;
                    break;
                }
                if(pmax>=0)
                    break;
            }
            out<<pmax<<endl;
        }
        else if(intrebare==1)
        {
            st=1;
            dr=M;
            int pm=-1;
            while(st<=dr)
            {
                int m=(st+dr)/2;
                if(v[m]>val)
                {
                    dr=m-1;
                }
                else if(v[m]<=val)
                {
                    while(v[m]<=val && m<=M)
                    {
                        m++;
                    }
                    pm=m-1;
                    break;
                }
            }
            out<<pm<<endl;
        }
        else if(intrebare]==2)
        {
            st=1;
            dr=M;
            int pma=-1;
            while(st<=dr)
            {
                int m=(st+dr)/2;
                if(v[m]<val)
                {
                    st=m+1;
                }
                else if(v[m]>=val)
                {
                    while(v[m]>=val && m>0)
                    {
                        m--;
                    }
                    pma=m+1;
                    break;
                }
                if(pma>=0)
                break;
            }
            out<<pma<<endl;
        }
    }
    return 0;
}