Cod sursa(job #2428976)

Utilizator rd211Dinucu David rd211 Data 7 iunie 2019 01:21:01
Problema Cautare binara Scor 40
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 1.71 kb
#include <fstream>
using namespace std;
ifstream fin("cautbin.in");
ofstream fout("cautbin.out");
int A[100003];

int Tip1(int numar,int st,int dr)
{
    int medie;
    while(st<=dr)
    {
        medie = st + (dr-st)/2;
        if(A[medie]<=numar)
        {
            st = medie + 1;
        }
        else
        {
            dr = medie - 1;
        }
    }
    medie = st + (dr-st)/2;
    if(A[medie]>numar)
        medie--;
    if(A[medie]==numar)
        return medie;
    return -1;
}
int Tip2(int numar,int st,int dr)
{
    int medie;
    while(st<dr)
    {
        medie = st + (dr-st)/2;
        if(A[medie]<=numar)
        {
            st = medie + 1;
        }
        else
        {
            dr = medie;
        }
    }
    medie = st + (dr-st)/2;
    if(A[medie]>numar)
        medie--;
    return medie;
}
int Tip3(int numar,int st,int dr)
{

    int medie;
    while(st<dr)
    {
        medie = st + (dr-st)/2;
        if(A[medie]<numar)
        {
            st = medie + 1;
        }
        else
        {
            dr = medie;
        }
    }
    medie = st + (dr-st)/2;
    if(A[medie]<numar)
        medie++;
    return medie;
}
int cautBin(int tip,int numar,int st,int dr)
{
    switch(tip)
    {
    case 0:
        return Tip1(numar,st,dr);
        break;
    case 1:
        return Tip2(numar,st,dr);
        break;
    case 2:
        return Tip3(numar,st,dr);
        break;
    }
}
int main()
{
    int n,m,tip,numar;
    fin>>n;
    for(int i = 1;i<=n;i++)
        fin>>A[i];
    fin>>m;
    for(int i = 0;i<m;i++)
    {
        fin>>tip>>numar;
        fout<<cautBin(tip,numar,1,n)<<endl;
    }
    return 0;
}