小a排序

一道思维题，要使区间内每个数都是连续的，即这个区间的最大值与最小值之差等于区间的长度。

#include<iostream>
using namespace std;
const int N = 1e5+1;
int a[N], b[N];
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  int n, s, t;
  cin >> n >> s >> t;
  for(int i = 1; i <= n; i++) {
    cin >> a[i];
    b[a[i]] = i;
  }
  int l = b[s], r = b[t];
  if(l > r) swap(l ,r);
  int Min = 0x3f3f3f3f, Max = 0;
  while(r - l != Max - Min) {
    for (int i = l; i <= r; i++) {
      Min = min(a[i], Min);
      Max = max(a[i], Max);
    }
    for (int i = Min; i <= Max; i++) {
      l = min(b[i], l);
      r = max(b[i], r);
    }
  }
  cout << l << " " << r << endl;
}