Pagini recente » Cod sursa (job #2961942) | Cod sursa (job #2810629) | Cod sursa (job #406600) | Cod sursa (job #157444) | Cod sursa (job #2073095)
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("cautbin.in");
ofstream g("cautbin.out");
int n,v[100001],m,i,a,b,c,q,x;
int caut0(int x)
{
int pas=1<<16,r=0;
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 pas=1<<16,r=0;
while(pas!=0)
{
if(r+pas<=n &&v[r+pas]<=x)r+=pas;
pas/=2;
}
return r;
}
int caut2(int x)
{
int pas=1<<16, r=0;
while(pas!=0)
{
if(r+pas<=n && !(v[r+pas]>=x))r+=pas;
pas/=2;
}
r++;
return r;
}
int main()
{
f>>n;
for(i=1; i<=n; i++)
{
f>>v[i];
}
f>>m;
while(m!=0)
{
f>>q>>x;
if(q==0) g<<caut0(x);
if(q==1) g<<caut1(x);
if(q==2) g<<caut2(x);
g<<"\n";
m--;
}
return 0;
}