Pagini recente » Cod sursa (job #1291529) | Cod sursa (job #1433358) | Cod sursa (job #22198) | Cod sursa (job #2248029) | Cod sursa (job #2209183)
#include <fstream>
#include <iostream>
using namespace std;
ifstream in("cautbin.in");
ofstream out("cautbin.out");
const int N=100005;
const int L=16;
int v[N],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(r==0 || 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,i,j,p,x;
in>>n;
for(i=1; i<=n; i++)
{
in>>v[i];
}
in>>m;
for(j=0; j<m; j++)
{
in>>p>>x;
if(p==0)
{
out<<caut0(x)<<"\n";
}
if(p==1)
{
out<<caut1(x)<<"\n";
}
if(p==2)
{
out<<caut2(x)<<"\n";
}
}
return 0;
}