Pagini recente » Cod sursa (job #1521804) | Rating Baican Vlad (xVlad) | Cod sursa (job #1256986) | Cod sursa (job #2976038) | Cod sursa (job #2767911)
#include <fstream>
using namespace std;
ifstream in ("cautbin.in");
ofstream out ("cautbin.out");
int v[10005];
int n;
int cautbin1(int poz)
{
int st = 1, dr = n, ans = -1;
while (st <= dr)
{
int mij = (st + dr) / 2;
if (v[mij] == poz )
{
ans = mij;
}
if ( v[mij] < poz )
{
st = mij + 1;
}
else
dr = mij - 1;
}
return ans;
}
int cautbin2(int val)
{
int st = 1, dr = n;
int ans = -1;
while ( st <= dr )
{
int mij = ( st + dr)/2;
if (v[mij] <= val)
{
st = mij + 1;
ans = mij;
}
else
dr = mij - 1;
}
return ans;
}
int cautbin3(int val)
{
int st = 1, dr = n;
int ans = -1;
while ( st <= dr)
{
int mij = ( st + dr) / 2;
if ( v[mij] >= val )
{
dr = mij - 1;
ans = mij;
}
else
st = mij + 1;
}
return ans;
}
int main()
{
int q, nr;
in>>n;
for ( int i = 1; i <= n; i ++ )
{
in >> v[i];
}
int m;
in >> m;
for ( int i = 1; i <= m ; i++ )
{
in >> q >> nr;
if ( q == 0)
{
out << cautbin1(nr) << '\n';
}
if ( q == 1)
out << cautbin2(nr) << '\n';
if( q == 2)
out << cautbin3(nr) << '\n';
}
}