题解

#include <bits/stdc++.h>
using namespace std;
int main()
{
    int n;
    cin >> n;
    int a[n];
    for (int i=0;i<n;i++)
    {
        cin >> a[i];
    }
    int m;
    cin >> m;
    while (m--)
    {
        int question;
        cin >> question;
        int l = 0,r = n-1,flag=0,ans=0;
        while (l <= r)
        {
            int mid = l + r >> 1;
            if (a[mid] == question)
            {
                r = mid-1;
                flag = 1;
                ans = mid;
            }
            else if (a[mid] < question)
            {
                l = mid+1;
            }
            else
            {
                r = mid-1;
            }
        }
        if (!flag)
        {
            cout << -1 << ' ';
        }
        else
        {
            cout << ans+1 << ' ';
        }
        l = 0,r = n-1,flag=0;
        ans = 0;
        while (l <= r)
        {
            int mid = l + r >> 1;
            if (a[mid] == question)
            {
                flag=1;
                l = mid+1;
                ans = mid;
            }
            else if (a[mid] < question)
            {
                l = mid+1;
            }
            else
            {
                r = mid-1;
            }
        }
        if (!flag) cout << -1 << ' ';
        else cout << ans+1 << ' ';
        int answer = upper_bound(a,a+n,question)-a;
        if (answer != n)cout << answer+1;
        else cout << -1;
        cout << endl;
    }
    return 0;
}