int find_end_of_left_subsequence(vector<int> array) {for (int i = 1; i < array.size(); ++i) {if (array[i] < array[i - 1]) {return i - 1;}}return array.size() - 1;
}int find_start_of_right_subsequence(vector<int> array) {for (int i = array.size() - 2; i >= 0; --i) {if (array[i] > array[i + 1]) {return i + 1;}}return 0;
}int shrink_left(vector<int> array, int min_idx, int start) {int cmp = array[min_idx];for (int i = start - 1; i >= 0; --i) {if (array[i] <= cmp) {return i + 1;}}return 0;
}int shrink_right(vector<int> array, int max_idx, int start) {int cmp = array[max_idx];for (int i = start; i < array.size(); ++i) {if (array[i] >= cmp) {return i - 1;}}return array.size() - 1;
}bool validate(vector<int> array, int left_idx, int right_idx) {vector<int> middle(right_idx - left_idx + 1);for (int i = left_idx; i <= right_idx; ++i) {middle[i - left_idx] = array[i];}sort(middle.begin(), middle.end());for (int i = left_idx; i <= right_idx; ++i) {array[i] = middle[i - left_idx];}for (int i = 1; i < array.size(); ++i) {if (array[i - 1] > array[i]) {return false;}}return true;
}void find_unsorted_sequence(vector<int> array) {int end_left = find_end_of_left_subsequence(array);if (end_left >= array.size() - 1) return;int start_right = find_start_of_right_subsequence(array);int max_idx = end_left;int min_idx = start_right;for (int i = end_left + 1; i < start_right; ++i) {if (array[i] < array[min_idx]) {min_idx = i;}if (array[i] > array[max_idx]) {max_idx = i;}}int left_idx = shrink_left(array, min_idx, end_left);int right_idx = shrink_right(array, max_idx, start_right);if (validate(array, left_idx, right_idx)) {cout << "True: " << left_idx << " " << right_idx << endl;} else {cout << "False: " << left_idx << " " << right_idx << endl;}
}