Cod sursa(job #2417946)
Utilizator | Data | 2 mai 2019 14:02:22 | |
---|---|---|---|
Problema | Cautare binara | Scor | 20 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 1.1 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("cautbin.in");
ofstream fout("cautbin.out");
int main()
{
int n,x,m,v[100],i,st,dr,mij,cerinta;
fin >> n;
for (i=1;i<=n;i++)
{
fin >> v[i];
}
fin >> m;
for (i=1;i<=m;i++)
{
fin >> cerinta >> x;
if (cerinta==0||cerinta==1)
{
st=1;
dr=n;
while (st<dr)
{
mij=(st+dr+1)/2;
if (v[mij]<=x) st=mij;
else dr=mij-1;
}
if (cerinta==0)
{
if (v[st]==x) fout << st << '\n';
else fout << -1 << '\n';
}
else
{
fout << st << '\n';
}
}
else if (cerinta==2)
{
st=1;
dr=n;
while (st<dr)
{
mij=(st+dr)/2;
if (v[mij]>=x) dr=mij;
else st=mij+1;
}
fout << st << '\n';
}
}
}