Pagini recente » Cod sursa (job #63632) | Cod sursa (job #1851018) | Cod sursa (job #1073603) | Cod sursa (job #813196) | Cod sursa (job #1802550)
#include <fstream>
#include<cmath>
using namespace std;
int main()
{
ifstream cin("cautbin.in");
ofstream cout("cautbin.out");
int n;
cin >> n;
int *v;
v=new int [n];
for(int i=1; i<=n; i++) cin >> v[i];
int m;
cin >> m;
for(int i=1; i<=m; i++)
{
int a, x;
cin >> a >> x;
if(a==1)
{
int mid, lo=1, hi=n;
while(lo<=hi)
{
mid=lo+(hi-lo)/2;
if(v[mid]<=x) lo=mid+1;
else hi=mid-1;
}
mid=lo+(hi-lo)/2;
if(v[mid]>x) mid--;
if(v[mid]==x) cout << mid << '\n';
else cout << -1 << '\n';
}
if(a==1)
{
int mid, lo=1, hi=n;
while(lo<hi)
{
mid=lo+(hi-lo)/4;
if(v[mid]<=x)lo=mid+1;
else hi=mid;
}
mid=lo+(hi-lo)/2;
if(v[mid]>x) --mid;
cout << mid << '\n';
}
if(a==2)
{
int mid, lo=1, hi=n;
while(lo<hi)
{
mid=lo+(hi-lo)/2;
if(v[mid]<x) lo=mid+1;
else hi=mid;
}
mid=lo+(hi-lo)/2;
if(v[mid]<x) ++mid;
cout << mid << '\n';
}
}
cin.ignore(2);
return 0;
}