Pagini recente » Cod sursa (job #1375207) | Cod sursa (job #3281417) | Cod sursa (job #3168299) | Cod sursa (job #2663295) | Cod sursa (job #2713207)
#include <fstream>
using namespace std;
ifstream fin("cautbin.in");
ofstream fout("cautbin.out");
int v[100001];
int main()
{
int n, m, a, st, dr, mij, sol, i, j, q;
fin>>n;
for(i=1; i<=n; i++)
fin>>v[i];
fin>>m;
for(j=1; j<=m; j++){
fin>>q>>a;
if(q==0){
st=1;
dr=n;
sol=-1;
while(st<=dr){
mij=(st+dr)/2;
if(v[mij]==a)
sol=mij;
if(v[mij]<=a)
st=mij+1;
if(v[mij]>a)
dr=mij-1;
}
fout<<sol<<endl;
}
if(q==1){
st=1;
dr=n;
sol=-1;
while(st<=dr){
mij=(st+dr)/2;
if(v[mij]<=a){
sol=mij;
st=mij+1;
}
else
dr=mij-1;
}
fout<<sol<<endl;
}
if(q==2){
st=1;
dr=n;
sol=-1;
while(st<=dr){
mij=(st+dr)/2;
if(v[mij]>=a){
sol=mij;
dr=mij-1;
}
else
st=mij+1;
}
fout<<sol<<endl;
}
}
return 0;
}