Pagini recente » Cod sursa (job #1435907) | Cod sursa (job #2612482) | Cod sursa (job #28201) | Cod sursa (job #100418) | Cod sursa (job #1155711)
#include <fstream>
#define dim 100001
using namespace std;
ifstream f("cautbin.in");
ofstream g("cautbin.out");
int n,m,rez,y;
unsigned int a[dim],b;
int binsearch(int x){
unsigned int i,step;
for(step=1;step<n;step<<=1);
for(i=0;step;step>>=1)
if(a[i+step]<=x && step+i<n) i+=step;
return i;
}
int main(){
int i;
f>>n;
for(i=1;i<=n;i++)
f>>a[i];
f>>m;
for(i=1;i<=m;i++){
f>>y>>b;
rez=binsearch(b);
switch(y){
case 0:
if(a[rez]==b){
while(a[rez]==b) rez++;
g<<rez-1<<"\n";
}
else g<<-1<<"\n";
break;
case 1:
while(a[rez]>b) rez--;
while(a[rez]<=b) rez++;
g<<rez-1<<"\n";
break;
case 2:
while(a[rez]<b) rez++;
while(a[rez]>=b) rez--;
g<<rez+1<<"\n";
break;
}
}
}