Pagini recente » Cod sursa (job #2538997) | Cod sursa (job #1415665) | Cod sursa (job #1720682) | Cod sursa (job #2778330) | Cod sursa (job #2857619)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("cautbin.in");
ofstream fout("cautbin.out");
int n, m, v[100005], cerinta, x;
int Cerinta0()
{
int poz = -1;
int st = 1, dr = n, mij;
while (st <= dr)
{
mij = (st + dr) / 2;
if (x == v[mij])
{
poz = mij;
st = mij + 1;
}
else if (x < v[mij])
{
st = mij + 1;
}
else if (x > v[mij])
{
dr = mij - 1;
}
}
return poz;
}
int Cerinta1(int st, int dr)
{
if (st > dr)
{
return -1;
}
int mij = (st + dr) / 2;
if (v[mij] <= x)
{
int poz = Cerinta1(mij + 1, dr);
if (poz == -1)
{
return mij;
}
return poz;
}
else
{
return Cerinta1(st, dr - 1);
}
}
int Cerinta2()
{
int st = 1, dr = n;
int poz, mij;
while (st <= dr)
{
mij = (st + dr) / 2;
if (v[mij] >= x)
{
poz = mij;
dr = mij - 1;
}
else
{
st = mij + 1;
}
}
return poz;
}
int main()
{
fin >> n;
for (int i = 1; i <= n; i++)
{
fin >> v[i];
}
fin >> m;
for (int i = 1; i <= m; i++)
{
fin >> cerinta >> x;
if (cerinta == 0)
{
fout << Cerinta0() << '\n';
}
else if (cerinta == 1)
{
fout << Cerinta1(1, n) << '\n';
}
else if (cerinta == 2)
{
fout << Cerinta2() << '\n';
}
}
return 0;
}