[leetcode] 915. Partition Array into Disjoint Intervals : https://leetcode.com/problems/partition-array-into-disjoint-intervals/

Partition Array into Disjoint Intervals.cc

class Solution {
public:
    int partitionDisjoint(vector<int>& A) {
        int size = A.size();
        
        vector<int> minArr(size);
        minArr[size-1] = A[size-1];
        for(int i=size-2;i>=0;i--){
            minArr[i] = min(A[i], minArr[i+1]);
        }
        
        int maxNum=A[0];
        int ans = 0;
        while(ans+1 < size && maxNum > minArr[ans+1]){
            ans++;
            maxNum = max(maxNum, A[ans]);
        }
        
        return ans + 1;
    }
};