PAT甲级真题 1101 Quick Sort (25分) C++实现 (快排基准位置，与有序数列位置相同是必要非充分条件)

最新推荐文章于 2022-01-24 06:11:16 发布

zhang35

最新推荐文章于 2022-01-24 06:11:16 发布

阅读量194

点赞数

分类专栏： PAT 文章标签：排序算法快排基准点测试点格式错误

本文链接：https://blog.csdn.net/zhang35/article/details/107634571

版权

该博客讨论了PAT甲级考试中关于快速排序算法的一道题目，涉及如何确定合适的基准点。博主指出，基准点必须满足所有小于它的元素在其左侧，但仅此条件并不充分。通过创建排序后的数组并比较，找到可能的基准点。在实现过程中遇到了测试点的错误，特别是格式问题，需要在输出末尾添加换行符。最后，博主提供了一种改进的解决方案，通过维护原数组中当前位置之前的最大值来确保正确选择基准点。

摘要由CSDN通过智能技术生成

题目

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⁵ ). Then the next line contains N distinct positive integers no larger than 10⁹. 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: