Pagini recente » Cod sursa (job #3003121) | Cod sursa (job #2770852) | Monitorul de evaluare | Cod sursa (job #2064632) | Cod sursa (job #2277143)
#include <iostream>
#include <fstream>
using namespace std;
int s[100000],N,M,v[10000],p,u,ok,i,m;
ifstream f("cautbin.in");
ofstream g("cautbin.out");
void intrebare1( int x)
{ int poz;
int p=1;int u=N;
while(p<=u&&!ok)
{m=(p+u)/2;
if(v[m]<=x) {poz=m;
p=m+1;
}
else u=m+1;
}
if(v[poz]!=x) g<<-1<<endl;
else g<<poz<<endl;
}
void intrebare2( int x)
{int poz;
int p=1;int u=N;
while(p<=u&&!ok)
{m=(p+u)/2;
if(v[m]<=x) {poz=m;
p=m+1;
}
else u=m+1;
}
g<<poz<<endl;
}
void intrebare3( int x)
{int poz;
int p=1;int u=N;
while(p<=u&&!ok)
{m=(p+u)/2;
if(v[m]>=x){poz=m;
u=m-1;}
else u=m+1;
}
g<<poz<<endl;
}
int main() {
int x,y;
f>>N;
for(i=1;i<=N;i++) f>>v[i];
cin>>M;
for(i=1;i<=M*2;i++) f>>x>>y;
if(y==0) intrebare1(x);
else if(y==1) intrebare2(x);
else intrebare3(x);
return 0;
}