Pagini recente » Cod sursa (job #2142309) | Cod sursa (job #1530095) | Cod sursa (job #1283224) | Cod sursa (job #2461128) | Cod sursa (job #2922164)
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
freopen("cautbin.in", "r", stdin);
freopen("cautbin.out", "w", stdout);
int n;
cin >> n;
vector<int> v(n);
for (int i = 0; i < n; i++)
{
cin >> v[i];
}
int m;
cin >> m;
for (int i = 0; i < m; i++)
{
int x, y;
cin >> x >> y;
if (x == 0)
{
int mx = -1;
int st = 0, dr = n - 1;
while (st <= dr)
{
int mid = (st + dr) / 2;
if (v[mid] > y)
{
dr = mid - 1;
}
else if (v[mid] < y)
{
st = mid + 1;
}
else if (v[mid] == y)
{
mx = mid;
st = mid + 1;
}
}
cout << mx + 1 << "\n";
}
else if (x == 1)
{
int mx = -1;
int st = 0, dr = n - 1;
while (st <= dr)
{
int mid = (st + dr) / 2;
if (v[mid] > y)
{
dr = mid - 1;
}
else if (v[mid] <= y)
{
st = mid + 1;
mx = mid;
}
}
cout << mx + 1 << "\n";
}
else if (x == 2)
{
int mx = -1;
int st = 0, dr = n - 1;
while (st <= dr)
{
int mid = (st + dr) / 2;
if (v[mid] >= y)
{
dr = mid - 1;
mx = mid;
}
else if (v[mid] < y)
{
st = mid + 1;
}
}
cout << mx + 1 << "\n";
}
}
return 0;
}