Pagini recente » Cod sursa (job #1349567) | Cod sursa (job #1888296) | Cod sursa (job #1007993) | Cod sursa (job #948656) | Cod sursa (job #2565405)
#include <fstream>
using namespace std;
ifstream f("cautbin.in");
ofstream g("cautbin.out");
int v[100100];
int n, i, st, dr, mid, m, tip, x;
int main()
{
f>>n;
for( i=1; i <= n; i++ )
f>>v[i];
for ( f>>m; m--; ){
f>>tip>>x;
if ( !tip ){
st = 1; dr = n;
while ( st <= dr ){
mid = st+((dr-st)>>1);
if ( v[mid] <= x )
st = mid+1;
else dr = mid-1;
}
if ( v[dr] == x )
g<<dr<<"\n";
else g<<"-1\n";
continue;
}
if ( tip == 1 ){
st = 1; dr = n;
while ( st <= dr ){
mid = st+((dr-st)>>1);
if ( v[mid] <= x )
st = mid+1;
else dr = mid-1;
}
g<<dr<<"\n";
continue;
}
st = 1; dr = n;
while ( st <= dr ){
mid = st+((dr-st)>>1);
if ( v[mid] >= x )
dr = mid-1;
else st = mid+1;
}
g<<st<<"\n";
}
return 0;
}