Pagini recente » Cod sursa (job #249709) | Cod sursa (job #1209035) | Cod sursa (job #261964) | Cod sursa (job #2506755) | Cod sursa (job #2596805)
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("cautbin.in");
ofstream g("cautbin.out");
int v[100010],n;
void cautare0(int y)
{
int r=0;
for(int p=30; p>=0; p--)
if(r+(1<<p)<=n and v[r+(1<<p)]<=y)
r+=(1<<p);
if(v[r]==y)
g<<r<<"\n";
else
g<<-1<<"\n";
}
void cautare1(int y)
{
int r=0;
for(int p=30; p>=0; p--)
if(r+(1<<p)<=n and v[r+(1<<p)]<=y)
r+=(1<<p);
if(v[r]<=y)
g<<r<<"\n";
}
void cautare2(int y)
{
int r=0,q=0;
for(int p=30; p>=0; p--)
if(r+(1<<p)<=n and v[r+(1<<p)]<=y)
r+=(1<<p);
for(int p=30; p>=0; p--)
if(q+(1<<p)<=n and v[q+(1<<p)]<y)
q+=(1<<p);
r=(r+q)/2;
if(v[r]<y)
r+=1;
g<<r<<"\n";
}
int main()
{
int m;
f>>n;
for(int i=1; i<=n; i++)
f>>v[i];
f>>m;
for(int i=1; i<=m; i++)
{
int x,y;
f>>x>>y;
if(x==0)
cautare0(y);
else
{
if(x==1)
cautare1(y);
else
cautare2(y);
}
}
return 0;
}