PAT B1045/A1101 题解---超时以及格式错误的解决

---

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

---

题目名称其实空有其名，这道题和快排毛关系都没有。按做题的方法来说的话，其实它应该算是类two pointers的题。
题目大意：

---

题目的坑：
1.超时：这个问题其实看TL就知道不可能用O(n^2)的算法来实现，因此需要优化。主要的方法就是在确定此位前是否都小，后是否都大的过程，使用两个标maxnum和minnum来比较就可以了，不需要多做一层循环，降低时间复杂度。
2.格式错误：格式错误有两个测试点，其中一个是行末不能有空格，另一个其实我找了很久也没有找出来，最后看了晴神的code，说这个测试点其实是要求在主元的数量为0的时候，还要进行换行，所以需要在这个位置加入一个换行（个人觉得这个测试点有点刁钻，没有必要！！！）

---