Pagini recente » Istoria paginii runda/zienuntu | Cod sursa (job #1690645) | Cod sursa (job #988460) | Cod sursa (job #1052293) | Cod sursa (job #1372814)
#include <iostream>
#include <fstream>
using namespace std;
ifstream in ("cautbin.in");
ofstream out ("cautbin.out");
int main()
{
int n,m,tip,i,v[100000],x,pas;
in>>n;
for(i=1;i<=n;i++){
in>>v[i];
}
in>>m;
while(m--){
in>>tip;
in>>x;
if(tip==0)
{
i=0;
pas=1<<15;
while(pas!=0){
if(i+pas<=n && v[i+pas]<=x)
i+=pas;
pas/=2;
}
if(v[i]==x)
out<<i<<'\n';
else
out<<-1<<'\n';
}
if(tip==1)
{
i=0;
pas=1<<15;
while(pas!=0){
if(i+pas<=n && v[i+pas]<=x)
i+=pas;
pas/=2;
}
out<<i<<'\n';
}
if(tip==2)
{
i=0;
pas=1<<15;
while(pas!=0){
if(i+pas<=n && v[i+pas]<x)
i+=pas;
pas/=2;
}
out<<i+1<<'\n';
}
}
return 0;
}