Cod sursa(job #2169988)

Utilizator SkyConectorOvidiu Sonea SkyConector Data 14 martie 2018 20:21:22
Problema Cautare binara Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 1.59 kb
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("cautbin.in");
ofstream fout("cautbin.out");
int n,m,v[100003];
void citire(int &n,int &m,int v[1000003])
{
    fin>>n;
    for(int i=1;i<=n;i++)
    {
        fin>>v[i];
    }
    fin>>m;
}
int query1(int nr)
{
    int l=1;int r=n,m=(l+r)/2;
    while(l<r)
    {
        if(v[m]==nr && v[m+1]>nr)
            return m;
        else if(v[m]>=nr)
        {
            l=m+1;
            m=(l+r)/2;
        }
        else
        {
            r=m-1;
            m=(l+r)/2;
        }
    }
    return -1;
}
int query2(int nr)
{
    int l=1;int r=n,m=(l+r)/2;
    while(l<r)
    {
        if(v[m]<=nr && v[m+1]>nr)
            return m;
        else if(v[m]>=nr)
        {
            l=m+1;
            m=(l+r)/2;
        }
        else
        {
            r=m-1;
            m=(l+r)/2;
        }
    }
}
int query3(int nr)
{
    int l=1;int r=n,m=(l+r)/2;
    while(l<r)
    {
        if(v[m]>=nr && v[m-1]<nr)
            return m;
        else if(v[m]>=nr)
        {
            r=m+1;
            m=(l+r)/2;
        }
        else
        {
            l=m-1;
            m=(l+r)/2;
        }
    }
}
int main()
{
    citire(n,m,v);
    int val,poz;
    for(int i=1;i<=m;i++)
    {
        fin>>val>>poz;
        if(val==0)
        {
            fout<<query1(poz)<<'\n';
        }
        else if(val==1)
        {
            fout<<query2(poz)<<'\n';
        }
        else
        {
            fout<<query3(poz)<<'\n';
        }
    }
    return 0;
}