Cod sursa(job #3038285)
Utilizator | Data | 27 martie 2023 10:31:00 | |
---|---|---|---|
Problema | Cautare binara | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 1.22 kb |
#include <fstream>
using namespace std;
ifstream fin ("cautbin.in");
ofstream fout ("cautbin.out");
int n,i,st,dr,c,x,m,mij,v[100001];
int main()
{
fin>>n;
for (i=1; i<=n; i++)
fin>>v[i];
fin>>m;
for (i=1; i<=m; i++)
{
fin>>c>>x;
st=1;
dr=n;
if (c==0)
{
while (st<=dr)
{
mij=(st+dr)/2;
if (v[mij]<=x)
st=mij+1;
else
dr=mij-1;
}
if (v[dr]==x)
fout<<dr<<"\n";
else
fout<<-1<<"\n";
}
if (c==1)
{
while (st<=dr)
{
mij=(st+dr)/2;
if (v[mij]<=x)
st=mij+1;
else
dr=mij-1;
}
fout<<dr<<"\n";
}
if (c==2)
{
while (st<=dr)
{
mij=(st+dr)/2;
if (v[mij]>=x)
dr=mij-1;
else
st=mij+1;
}
fout<<st<<"\n";
}
}
return 0;
}