Pagini recente » Cod sursa (job #2728778) | Cod sursa (job #1227340) | Cod sursa (job #2697502) | Cod sursa (job #2795165) | Cod sursa (job #3151215)
#include <iostream>
#include <fstream>
using namespace std;
ifstream in("cautbin.in");
ofstream out("cautbin.out");
const int maxi = 100000;
int v[maxi+1];
int caut(int nr, int n)
{
int st=1,dr=n;
int ans = -1;
while(st<=dr)
{
int mij=(st+dr)/2;
if(v[mij]<=nr)
{
ans = mij;
st=mij+1;
}
else
{
dr=mij-1;
}
}
return ans;
}
int caut2(int nr, int n)
{
int st=1,dr=n;
int ans = -1;
while(st<=dr)
{
int mij=(st+dr)/2;
if(v[mij]>=nr)
{
ans = mij;
dr=mij-1l;
}
else
{
st=mij+1;
}
}
return ans;
}
int main()
{
int n;
in>>n;
for(int i=1; i<=n; ++i)
in>>v[i];
int m;
in>>m;
for(int i=0; i<m; ++i)
{
int x, y;
in>>x>>y;
if(x==0 || x==1)
{
out<<caut(y, n)<<endl;
}
else
out<<caut2(y,n)<<endl;
}
return 0;
}