<p>You are given an integer array <code>arr</code>.</p>

<p>We split <code>arr</code> into some number of <strong>chunks</strong> (i.e., partitions), and individually sort each chunk. After concatenating them, the result should equal the sorted array.</p>

<p>Return <em>the largest number of chunks we can make to sort the array</em>.</p>

<p>&nbsp;</p>
<p><strong class="example">Example 1:</strong></p>

<pre>
<strong>Input:</strong> arr = [5,4,3,2,1]
<strong>Output:</strong> 1
<strong>Explanation:</strong>
Splitting into two or more chunks will not return the required result.
For example, splitting into [5, 4], [3, 2, 1] will result in [4, 5, 1, 2, 3], which isn&#39;t sorted.
</pre>

<p><strong class="example">Example 2:</strong></p>

<pre>
<strong>Input:</strong> arr = [2,1,3,4,4]
<strong>Output:</strong> 4
<strong>Explanation:</strong>
We can split into two chunks, such as [2, 1], [3, 4, 4].
However, splitting into [2, 1], [3], [4], [4] is the highest number of chunks possible.
</pre>

<p>&nbsp;</p>
<p><strong>Constraints:</strong></p>

<ul>
	<li><code>1 &lt;= arr.length &lt;= 2000</code></li>
	<li><code>0 &lt;= arr[i] &lt;= 10<sup>8</sup></code></li>
</ul>

class Solution {
public:
    int maxChunksToSorted(vector<int>& arr) {
        vector<pair<int,int>> data;
        for(int i=0; i<arr.size(); i++) {
            data.push_back({arr[i], i});
        }
        auto cmp = [](pair<int,int>&a, pair<int,int>&b) {
            if(a.first == b.first) a.second < b.second;
            return a.first < b.first;
        };
        stable_sort(data.begin(), data.end());
        map<int,int> itor;
        for(int i=0; i<data.size(); i++) {
            itor[data[i].second] = i;
        }

        int r = 0;
        int ans = 0;
        while(r < arr.size()) {
            int next = r;
            int small = INT_MAX;
            int large = -1;
            while(next < arr.size() && (small != r || large != next-1)) {
                small = min(small, itor[next]);
                large = max(large, itor[next]);
                next++;

                cout<<small<<large<<','<<r<<next<<' ';
            }
            cout<<endl;
            r = next;
            ans++;
        }
        return ans;
    }
};
19900