Pagini recente » Cod sursa (job #3253577) | Cod sursa (job #986977) | Cod sursa (job #3257143) | Cod sursa (job #1495950) | Cod sursa (job #2630015)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("cautbin.in");
ofstream fout("cautbin.out");
int n , m, a[100005], i, x;
void citire()
{
fin >> n;
for(int i = 1; i <= n; i++)
{
fin >> a[i];
}
}
void Cautare0(int z)
{
int st = 1, dr = n, mij, poz = -1;
while(st <= dr)
{
mij = (st + dr) / 2;
if(a[mij] > z)
{
dr = mij - 1;
}
if(a[mij] < z)
{
st = mij + 1;
}
if(a[mij] == z)
{
poz = mij;
st = mij + 1;
}
}
fout << poz << "\n";
}
void Cautare1(int z)
{
int st = 1, dr = n, mij, poz = 0;
{
while(st <= dr)
{
mij = (st + dr) / 2;
if(a[mij] > z)
{
dr = mij - 1;
}
if(a[mij] <= z)
{
poz = mij;
st = mij + 1;
}
}
}
fout << poz << "\n";
}
void Cautare2(int z)
{
int st = 1, dr = n, mij, poz = -1;
while(st <= dr)
{
mij = (st + dr) / 2;
if(a[mij] < z)
{
st = mij + 1;
}
if(a[mij] >= z)
{
poz = mij;
dr = mij - 1;
}
}
fout << poz;
}
int main()
{
citire();
fin >> m;
for(int i = 1; i <= m; i++)
{
fin >> i >> x;
if(i == 0)
{
Cautare0(x);
}
if(i == 1)
{
Cautare1(x);
}
if(i == 2)
{
Cautare2(x);
}
}
return 0;
}