Cod sursa(job #1902344)

Utilizator DanSDan Teodor Savastre DanS Data 4 martie 2017 15:28:54
Problema Cautare binara Scor 30
Compilator cpp Status done
Runda Arhiva educationala Marime 1.64 kb
#include <iostream>
#include <fstream>

using namespace std;

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

int v[100001];



int caut(int n, int x, int a, int b)
{
    if (a == b || b<a)
    {
        if (v[a] == x)
            return a;
        else
            return -1;
    }
    int pos = (a+b)/2;
    if(v[pos] < x)
    {
        return caut(n, x, pos+1, b);
    }
    else if(x < v[pos])
    {
        return caut(n, x, a, pos-1);
    }
    else if(v[pos] == x) return pos;

    return -1;
}

int main()
{
    int n, m, x, i, c;
    in>>n;
    for(i=1; i<=n; i++)
        in>>v[i];
    in>>m;
    for(i=1; i<=m; i++)
    {
        in>>c>>x;
        if(c == 0)
        {
            int nr = caut(n, x, 1, n);
            while(v[nr+1] == x) nr++;
            out<<nr<<'\n';
        }
        if(c == 1)
        {
            if(caut(n, x, 1, n) == -1)
            {
                while(caut(n, x, 1, n) == -1)
                    x--;
                out<<caut(n, x, 1, n)<<'\n';
            }
            else
            {
                int nr = caut(n, x, 1, n);
                while(v[nr+1] == x) nr++;
                out<<nr<<'\n';
            }
        }
        if(c == 2)
        {
            if(caut(n, x, 1, n) == -1)
            {
                while(caut(n, x, 1, n) == -1)
                    x++;
                out<<caut(n, x, 1, n)<<'\n';
            }
            else
            {
                int nr = caut(n, x, 1, n);
                while(v[nr-1] == x) nr--;
                out<<nr<<'\n';
            }
        }
    }
    return 0;
}