【PAT】A1101/B1045 Quick Sort/快速排序【动态规划】

最新推荐文章于 2022-07-28 11:52:00 发布

昵称五个字

最新推荐文章于 2022-07-28 11:52:00 发布

阅读量684

点赞数 2

分类专栏： PAT

本文链接：https://blog.csdn.net/a617976080/article/details/95457437

版权

该博客讨论了快速排序中的分区过程，并解释如何确定哪些元素可能作为主元。博主给出了输入输出规范，样本输入输出，以及解决问题的思路和代码实现。通过示例解释，展示了如何找到主元候选者并计数。

摘要由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^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.