1101 Quick Sort (25 分)（超时，格式错误原因）

There is a classical process named partition in the famous quick sort algorithm. In this process we typically choose one element as the pivot. Then the elements less than the pivot are moved to its left and those larger than the pivot to its right. Given N distinct positive integers after a run of partition, could you tell how many elements could be the selected pivot for this partition?

For example, given N=5 and the numbers 1, 3, 2, 4, and 5. We have:

1 could be the pivot since there is no element to its left and all the elements to its right are larger than it;
3 must not be the pivot since although all the elements to its left are smaller, the number 2 to its right is less than it as well;
2 must not be the pivot since although all the elements to its right are larger, the number 3 to its left is larger than it as well;
and for the similar reason, 4 and 5 could also be the pivot.
Hence in total there are 3 pivot candidates.

Input Specification:
Each input file contains one test case. For each case, the first line gives a positive integer N (≤10
5
). Then the next line contains N distinct positive integers no larger than 10
9
. The numbers in a line are separated by spaces.

Output Specification:
For each test case, output in the first line the number of pivot candidates. Then in the next line print these candidates in increasing order. There must be exactly 1 space between two adjacent numbers, and no extra space at the end of each line.

Sample Input:

5
1 3 2 4 5

Sample Output:

3
1 4 5

正如题目的标题，本题采用与快速排序类似的思路，我们知道快速排序每次能够选择出一个元素，左边的都小，右边的都大，那么本题，如果排序好的数组与原数组中，位置没有发生变化，就说明该数字是符合条件的，我们只需要判断排序好的数组与原数组的关系
但是，有特殊情况，当某个元素，左右两边的元素相等时，比如 5 1 3 4 2，排好序变成 1 2 3 4 5，此时，3 的位置不变，但是不满足题意，解决的办法也比较简单，维护一个左边最大的 max，当某个数位置不变并且大于 max 的时候，说明排好序的，每次更新 左边最大的 max，举例：此时该数字是 3，左边的最大 max 是 5，不满足大于 max，所以 3 就不满足题意

格式错误原因是因为，如果 count 等于 0，需要单独输出一个回车

#include<iostream>
#include<string>
#include<algorithm>
#include<bits/stdc++.h>
#include<stack>
#include<set>
#include<vector>
#include<map>
#include<queue>
#include<deque>
#include<cctype>
#include<unordered_set>
#include<unordered_map>
#include<fstream>
#include<cstring>
using namespace std;
int n;
int a[100001];
int b[100001];
int main() {
	cin >> n;
	for (int i = 0; i < n; i++) {
		cin >> a[i];
		b[i] = a[i];
	}
	vector<int> v;
	int count = 0;
	sort(b, b + n);
	int max = 0;
	for (int i = 0; i < n; i++) {
		if (a[i] == b[i] && a[i] > max) {
			v.push_back(a[i]);
			count++;
		} 
		if (a[i] > max) {
			max = a[i];
		}
	}
	cout << count << endl;
	if (count) { 
		for (int i = 0; i < v.size(); i++) {
			if (!i) {
				cout << v[i];
			} else {
				cout << " " << v[i];
			}
		}
	} else {
		cout << endl;
	}
}