Cod sursa(job #2565436)
Utilizator | Data | 2 martie 2020 14:14:08 | |
---|---|---|---|
Problema | Cautare binara | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 1.13 kb |
#include <fstream>
using namespace std;
ifstream fin ("cautbin.in");
ofstream fout ("cautbin.out");
int v[100010], i, n, m, c, x;
long long st, dr;
int main()
{
fin>>n;
for (i=1; i<=n; i++)
fin>>v[i];
fin>>m;
for (i=1; i<=m; i++)
{
fin>>c>>x;
if (c!=2)
{
st=1;
dr=n;
while (st<=dr)
{
long long mid=(st+dr)/2;
if (v[mid]>x)
dr=mid-1;
else
st=mid+1;
}
if (c==0)
{
if (v[dr]!=x)
fout<<-1<<"\n";
else
fout<<dr<<"\n";
}
if (c==1)
fout<<dr<<"\n";
}
else
{
st=1;
dr=n;
while (st<=dr)
{
long long mid=(st+dr)/2;
if (v[mid]>=x)
dr=mid-1;
else
st=mid+1;
}
fout<<st<<"\n";
}
}
}