Cod sursa(job #2502964)

Utilizator CatalinaPHOVornicu Catalina-Cristina CatalinaPHO Data 1 decembrie 2019 22:49:00
Problema Cautare binara Scor 100
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 2.12 kb
#include <iostream>
#include <fstream>
 
using namespace std;
 
int n, m, a[100003];
int main()
{
    ifstream fin ("cautbin.in");
    ofstream fout ("cautbin.out");
    fin >> n;
    for (int i=0; i<n; i++)
    {
        fin >> a[i];
    }
    fin >> m;
    for (int i=0; i<m; i++)
    {
        int op, x;
        fin >> op >> x;
        if (op==0)
        {
            int st = 0;
            int dr = n-1;
            int p = -2;
            while (st <= dr)
            {
                int mid = (st + dr) / 2;
 
                if (a[mid] == x && (mid == n-1 || a[mid + 1] != x))
                {
                    p = mid;
                    break;
                }
                if (a[mid] > x)
                {
                    dr = mid-1;
                }
                else
                {
                    st = mid+1;
                }
            }
            fout << p+1 << '\n';
        }
        if (op == 1)
        {
            int st=0;
            int dr=n-1;
            int p=-1;
            while(st<=dr)
            {
                int mid=(st+dr)/2;
                if(a[mid]<=x && (mid == n-1 || a[mid+1]>x))
                {
                    p=mid;
                    break;
                }
                if (a[mid] <= x)
                {
                    st=mid+1;
                }
                else
                {
                    dr=mid-1;
                }
            }
            fout <<p+1 << '\n';
        }
        if (op==2)
        {
            int st=0;
            int dr=n-1;
            int p=-1;
            while (st<=dr)
            {
                int mid=(st+dr)/2;
                if (a[mid]>=x && (mid==0 || a[mid-1]<x))
                {
                    p=mid;
                    break;
                }
                if (a[mid] >= x)
                {
                    dr=mid-1;
                }
                else
                {
                    st=mid+1;
                }
            }
            fout << p+1 << '\n';
        }
    }
    return 0;
}