小a的排列

#include<iostream>
#include<algorithm>
using namespace std;
int n, x, y;
int pre[100005];
int main()
{
    int l, r;
    cin >> n >> x >> y;
    for (int i = 1; i <= n; ++i)
    {
        cin >> pre[i];
        if (pre[i] == x)l = i;
        if (pre[i] == y)r = i;
    }
    if (l > r)swap(l, r);
    int xx = 0, yy = n + 1;
    while (r - l != xx - yy){
        for (int i = l; i <= r; ++i){
            xx = max(xx, pre[i]);
            yy = min(yy, pre[i]);
        }
        for (int i = 1; i <= n; ++i){
            if (pre[i] > yy&&pre[i] < xx&&i < l)l = i;
            if (pre[i]>yy&&pre[i]<xx&&i>r)r = i;
        }
    }
    cout << l << " "<<r << endl;
}