Pagini recente » Cod sursa (job #2560011) | Cod sursa (job #2084243) | Cod sursa (job #1143901) | Cod sursa (job #2589893) | Cod sursa (job #2779234)
#include <fstream>
using namespace std;
const int N = 100000;
int v[ N ];
int main() {
ifstream fin ( "cautbin.in" );
ofstream fout ( "cautbin.out" );
int n, i, m, c, x, st, dr, mij;
fin >> n;
for ( i = 0; i < n; i++ )
fin >> v[ i ];
fin >> m;
for ( i = 0; i < m; i++ ){
fin >> c >> x;
if ( c == 0 ){
st = 0;
dr = n - 1;
while ( st != dr ) {
mij = ( dr + st ) / 2;
if ( v[ mij + 1 ] > x )
dr = mij;
else
st = mij + 1;
}
if ( x == v [ st ] )
fout << st + 1 << "\n";
else
fout << "-1\n";
}
else if ( c == 1 ){
st = 0;
dr = n - 1;
while ( st != dr ) {
mij = ( dr + st ) / 2;
if ( v[ mij + 1 ] > x )
dr = mij;
else
st = mij + 1;
}
fout << st + 1 << "\n";
}
else if ( c == 2 ){
st = 0;
dr = n - 1;
while ( st != dr ) {
mij = ( dr + st ) / 2;
if ( v[ mij ] >= x )
dr = mij;
else
st = mij + 1;
}
fout << st + 1 << "\n";
}
}
return 0;
}