Pagini recente » Cod sursa (job #2675156) | Istoria paginii runda/brasov_6_sr/clasament | Istoria paginii utilizator/malinac | Cod sursa (job #1126311) | Cod sursa (job #1360951)
#include <iostream>
#include <fstream>
using namespace std;
ifstream in("cautbin.in");
ofstream out("cautbin.out");
int v[100000],n,L=16;
int cautbin0(int x)
{
int i=0, pas=1<<L;
while(pas!=0)
{
if(i+pas<=n && v[i+pas]<=x)
i+=pas;
pas/=2;
}
if(v[i]==x)
return i;
return -1;
}
int cautbin1(int x)
{
int i=0, pas=1<<L;
while(pas!=0)
{
if(i+pas<=n && v[i+pas]<=x)
i+=pas;
pas/=2;
}
if(v[i]<=x)
return i;
}
int cautbin2(int x)
{
int i=0, pas=1<<L;
while(pas!=0)
{
if(i+pas<=n && v[i+pas]<x)
i+=pas;
pas/=2;
}
return i+1;
}
int main()
{
int i,m,j,tip,x;
in>>n;
for(i=1; i<=n; i++)
in>>v[i];
in>>m;
for(j=1; j<=m; j++)
{
in>>tip>>x;
if(tip==0)
out<<cautbin0(x)<<"\n";
if(tip==1)
out<<cautbin1(x)<<"\n";
if(tip==2)
out<<cautbin2(x)<<"\n";
}
return 0;
}