最小调整有序

题目
难度：简单
类型：数组
类似题1

class Rearrange {
public:
    vector<int> findSegment(vector<int> A, int n) {
        
        int pmax = A[0], pidx = -1;
        for(int i = 0; i < n; i++){
            if(A[i] >= pmax) pmax = A[i];
            else pidx = i;
        }
        if(pidx == -1) return {0,0};
         int qmin = A[n-1], qidx = -1;
        for(int i = n-1; i >= 0; i--){
            if(A[i] <= qmin) qmin = A[i];
            else qidx = i;
        }
        return {qidx, pidx};
    }
};