Pagini recente » Cod sursa (job #1451693) | Cod sursa (job #174439) | Cod sursa (job #1391572) | Istoria paginii runda/12345678910 | Cod sursa (job #2398727)
#include <bits/stdc++.h>
using namespace std;
ifstream fin("cautbin.in");
ofstream fout("cautbin.out");
vector <pair <int,int> >v;
int N,M,a[100005],logN,lg;
int main()
{
fin >> N;
for(int i=1;i<=N;i++)
fin >> a[i];
fin >> M;
for(int i=1;i<=M;i++)
{
int A,B;
fin >> A >> B;
v.push_back(make_pair(A,B));
}
for(logN=1;logN<=N;logN<<=1);
for(int i=0;i<v.size();i++)
{
int t,x;
t=v[i].first;
x=v[i].second;
if(t<2)
{
int i;
for(lg=logN,i=0;lg;lg>>=1)
if(i+lg<=N and a[i+lg]<=x)
i+=lg;
if(t==0 and a[i]!=x)
fout << "-1" << endl;
else
fout << i << endl;
}
else
{
for(lg=logN,i=N;lg;lg>>=1)
if(i-lg>=1 and a[i-lg]>=x)
i-=lg;
fout << i << endl;
}
}
return 0;
}