Pagini recente » Cod sursa (job #1459947) | Cod sursa (job #324329) | Cod sursa (job #2573062) | Cod sursa (job #332535) | Cod sursa (job #2072183)
#include <fstream>
using namespace std;
ifstream in("cautbin.in");
ofstream out("cautbin.out");
const int N= 100001, L=16;
int v[N], n;
int cerinta0(int x)
{
int r=0;
int 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 cerinta2(int x)
{
int r=0;
int pas= 1<<L;
while(pas != 0)
{
if((r+pas) <= n && v[r+pas] < x)
r+= pas;
pas/= 2;
}
r++;
return r;
}
int cerinta1(int x)
{
int r=0;
int pas= 1<<L;
while(pas != 0)
{
if((r+pas) <= n && v[r+pas] <= x)
r+= pas;
pas/= 2;
}
return r;
}
int main()
{
int m, c, x;
in>>n;
for(int i=1; i<=n; i++)
in>>v[i];
in>>m;
for(int i=0; i<m; i++)
{
in>>c>>x;
if(c == 0)
out<<cerinta0(x)<<'\n';
else if(c == 1)
out<<cerinta1(x)<<'\n';
else
out<<cerinta2(x)<<'\n';
}
return 0;
}