Cod sursa(job #2967468)
Utilizator | Data | 19 ianuarie 2023 17:48:09 | |
---|---|---|---|
Problema | Cautare binara | Scor | 10 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 1.44 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream in("cautbin.in");
ofstream out("cautbin.out");
int v[100001];
int main()
{
int n, m, q, x;
in>>n;
for(int i=1;i<=n;i++)
in>>v[i];
in>>m;
for(int i=0;i<m;i++)
{
in>>q>>x;
if(q==0)
{
int st=1, dr=n, pozmax=-1;
while(st<=dr)
{
int m=(st+dr)/2;
if(v[m]==x)
{
pozmax=m;
st=m+1;
}
else
dr=m-1;
}
out<<pozmax<<"\n";
}
if(q==1)
{
int st=1, dr=n, pozmax=-1;
while(st<=dr)
{
int m=(st+dr)/2;
if(v[m]<=x)
{
pozmax=m;
st=m+1;
}
else
dr=m-1;
}
out<<pozmax<<"\n";
}
if(q==2)
{
int st=1, dr=n, pozmax=-1;
while(st<=dr)
{
int m=(st+dr)/2;
if(v[m]>=x)
{
pozmax=m;
dr=m-1;
}
else
st=m+1;
}
out<<pozmax<<"\n";
}
}
return 0;
}