Pagini recente » Cod sursa (job #374617) | Cod sursa (job #1565469) | Cod sursa (job #2065966) | Cod sursa (job #2073520) | Cod sursa (job #2071887)
#include <fstream>
using namespace std;
const int L=16;
const int N=100000;
int v[N],n, pas,r,x,m;
int caut0(int x)
{
int pas=1<<L;
int r=0;
while(pas!=0)
{
if(r+pas<=n && v[r+pas]<=x)
{
r=r+pas;
}
pas=pas/2;
}
if(v[r]!=x)
{
r=-1;
}
return r;
}
int caut1(int x)
{
int pas=1<<L;
int r=0;
while(pas!=0)
{
if(r+pas<=n && v[r+pas]<=x)
{
r=r+pas;
}
pas=pas/2;
}
return r;
}
int caut2(int x)
{
int pas=1<<L;
int r=0;
while(pas!=0)
{
if(r+pas<=n && !(v[r+pas]>=x))
{
r=r+pas;
}
pas=pas/2;
}
r++;
return r;
}
int main ( )
{
ifstream cin ("cautbin.in");
ofstream cout ("cautbin.out");
int cerinta;
cin>>n;
for(int i=1;i<=n;i++)
{
cin>>v[i];
}
cin>>m;
for(int i=1;i<=m;i++)
{
cin>>cerinta>>x;
if (cerinta == 0)
{
cout << caut0(x);
}
if (cerinta == 1)
{
cout << caut1(x);
}
if (cerinta == 2)
{
cout << caut2(x);
}
cout << endl;
}
return 0;
}