Pagini recente » Rezultatele filtrării | Cod sursa (job #2532968) | Cod sursa (job #2287641) | Cod sursa (job #133344) | Cod sursa (job #2074498)
#include <fstream>
using namespace std;
ifstream in("cautbin.in");
ofstream out("cautbin.out");
const int L=16;
const int N=100001;
int n,v[N];
int caut0(int x)
{
int r=0,pas=1<<L;
while(pas!=0)
{
if(r+pas<=n && v[r+pas]<=x)
{
r+=pas;
}
pas/=2;
}
if(v[r]!=x)
{
r=-1;
}
return r;
}
int caut1(int x)
{
int r=0,pas=1<<L;
while(pas!=0)
{
if(r+pas<=n && v[r+pas]<=x)
{
r+=pas;
}
pas/=2;
}
return r;
}
int caut2(int x)
{
int r=0,pas=1<<L;
while(pas!=0)
{
if(r+pas<=n && !(v[r+pas]>=x))
{
r+=pas;
}
pas/=2;
}
r++;
return r;
}
int main()
{
int m,tip,x;
in>>n;
for(int i=1; i<=n; i++) in>>v[i];
in>>m;
for(int i=1; i<=m; i++)
{
in>>tip>>x;
if(tip==0)
{
out<<caut0(x);
}
else if(tip==1)
{
out<<caut1(x);
}
else if(tip==2)
{
out<<caut2(x);
}
out<<"\n";
}
return 0;
}