Cod sursa(job #2359981)

Utilizator 566577Cont566 566577 Data 1 martie 2019 11:13:38
Problema Cautare binara Scor 0
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 1.69 kb
#include <iostream>
#include <fstream>
using namespace std;

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

int n, m, v[100005];

int binar1(int x)
{
    int st=1, dr=n, mid, poz=0;
    while(st<=dr)
    {
        mid=st+(dr-st)/2;
        if(v[mid]==x)
            break;
        else
            if(st<x)
                st=mid+1;
            else
                dr=mid-1;
    }

    while(v[++mid]==x && mid<=dr)
        poz=mid;

    if(poz==0)
        poz=-1;

    return poz;
}

int binar2(int y)
{
    int st=1, dr=n, mid, poz=0;
    while(st<=dr)
    {
        mid=st+(dr-st)/2;
        if(v[mid]==y)
            break;
        else
            if(st<y)
                st=mid+1;
            else
                dr=mid-1;
    }

    while(v[++mid]<=y && v[mid]>=st)
        poz=mid;

    return poz;
}

int binar3(int z)
{
    int st=1, dr=n, mid, poz=0;
    while(st<=dr)
    {
        mid=st+(dr-st)/2;
        if(v[mid]==z)
            break;
        else
            if(st<z)
                st=mid+1;
            else
                dr=mid-1;
    }

    while(v[--mid]>=z && mid>=st)
        poz=mid;

    return poz;
}

void CitesteSiRezolva()
{
    int aux1, aux2;

    fin>>n;
    for(int i=1; i<=n; i++)
        fin>>v[i];

    fin>>m;
    for(int i=1; i<=m; i++)
    {
        fin>>aux1>>aux2;
        switch(aux1)
        {
            case 0: fout<<binar1(aux2)<<endl;
            break;

            case 1: fout<<binar2(aux2)<<endl;
            break;

            case 2: fout<<binar3(aux2)<<endl;
            break;
        }
    }
}

int main()
{
    CitesteSiRezolva();
    return 0;
}