/* * @lc app=leetcode id=768 lang=cpp * * [768] Max Chunks To Make Sorted II */// @lc code=startclassSolution {public:intmaxChunksToSorted(vector<int>& arr) {constint N =arr.size(); vector<int>f(arr),b(arr);for (int i =1; i < N; ++i) f[i] =max(f[i -1],arr[i]);for (int i = N -2; i >=0; --i) b[i] =min(b[i +1],arr[i]);int res =1;for (int i =0; i < N -1; ++i) {if (f[i] <=b[i +1]) ++res; } return res; }};// @lc code=end