Pagini recente » Cod sursa (job #1973778) | Cod sursa (job #261522) | Cod sursa (job #1401794) | Cod sursa (job #331564) | Cod sursa (job #3121026)
#include <fstream>
using namespace std;
ifstream f("cautbin.in");
ofstream g("cautbin.out");
int v[100005];
int n, m;
void cb0(int x)
{
int st = 1;
int dr = n;
int m;
int ok = 1;
while(st <= dr)
{
m = (st + dr) / 2;
if(v[m] == x)
{
g<<m<<'\n';
ok = 0;
break;
}
else if(x > v[m])
{
st = m + 1;
}
else
{
dr = m - 1;
}
}
if(ok == 1)
{
g<<-1<<'\n';
}
}
void cb2(int x)
{
int st = 1;
int dr = n;
int m;
int poz;
while(st <= dr)
{
m = (st + dr) / 2;
if(x <= v[m])
{
dr = m - 1;
poz = m;
}
else
{
st = m + 1;
}
}
g<<poz<<'\n';
}
void cb1(int x)
{
int st = 1;
int dr = n;
int m;
int poz;
while(st <= dr)
{
m = (st + dr) / 2;
if(x >= v[m])
{
st = m + 1;
poz = m;
}
else
{
dr = m - 1;
}
}
g<<poz<<'\n';
}
int main()
{
f>>n;
for(int i = 1; i<=n; i++)
{
f>>v[i];
}
f>>m;
int c, x;
while(m--)
{
f>>c>>x;
if(c == 0)
{
cb0(x);
}
else if(c == 1)
{
cb1(x);
}
else if(c == 2)
{
cb2(x);
}
}
return 0;
}