Pagini recente » Cod sursa (job #2756445) | Cod sursa (job #3142783) | Cod sursa (job #1243503) | Monitorul de evaluare | Cod sursa (job #860664)
Cod sursa(job #860664)
#include<fstream>
using namespace std;
ifstream f("cautbin.in");
ofstream g("cautbin.out");
int n, m, v[100005], k, x, M, st, dr;
int main()
{
f>>n;
for (int i=1; i<=n; i++)
f>>v[i];
f>>m;
for (int j=1; j<=m; j++)
{
f>>k>>x;
st=0;
dr=n+1;
if (k==0)
{
while (st+1<dr)
{
M=(st+dr)/2;
if(x<v[M])
dr=M;
else
st=M;
}
if (v[st]==x)
g<<st<<"\n";
else
g<<"-1"<<"\n";
}
if (k==1)
{
while (st+1<dr)
{
M=(st+dr)/2;
if(x>=v[M])
st=M;
else
dr=M;
}
g<<st<<"\n";
}
if (k==2)
{
while (st+1<dr)
{
M=(st+dr)/2;
if(x<=v[M])
dr=M;
else
st=M;
}
g<<dr<<"\n";
}
}
return 0;
}