Pagini recente » Cod sursa (job #472558) | Cod sursa (job #1963474) | Cod sursa (job #1002870) | Cod sursa (job #1767337) | Cod sursa (job #2672197)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("cautbin.in");
ofstream fout("cautbin.out");
int n, v[100001], m, q, nr, st, dr, mij;
int main()
{
fin >> n;
for(int i = 1; i <= n; i++)
fin >> v[i];
fin >> m;
for(int i = 1; i <= m; i++)
{
fin >> q >> nr;
if(q == 0)
{
st = 1; dr = n;
while(st <= dr)
{
mij = (st + dr) / 2;
if(v[mij] > nr)
dr = mij - 1;
else st = mij + 1;
}
if(v[dr] == nr)
fout << dr << endl;
else fout << "-1" << endl;
}
else if(q == 1)
{
st = 1; dr = n;
while(st <= dr)
{
mij = (st + dr) / 2;
if(v[mij] > nr)
dr = mij - 1;
else
st = mij + 1;
}
fout << dr << endl;
}
else if(q == 2)
{
st = 1; dr = n;
while(st <= dr)
{
mij = (st + dr) / 2;
if(v[mij] < nr)
st = mij + 1;
else
dr = mij - 1;
}
fout << st << endl;
}
}
return 0;
}