快速排序+动态规划+输出细节 1101 Quick Sort (25分)

最新推荐文章于 2023-05-22 08:11:32 发布

豌豆射手GCC

最新推荐文章于 2023-05-22 08:11:32 发布

阅读量593

点赞数

分类专栏：数据结构 PAT

本文链接：https://blog.csdn.net/BLUEsang/article/details/105655210

版权

该博客讨论了快速排序中的分区过程，并提出使用动态规划来寻找潜在的枢轴元素。在给定一组不重复的正整数后，通过分析每个数左边是否都较小、右边是否都较大，来确定枢轴候选。博主给出了一种以空间换取时间的动态规划解决方案，包括建立两个数组分别记录每个位置左侧的最大值和右侧的最小值，然后找出满足条件的数并排序输出。文章还提醒注意边界情况和数组初始化策略。

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

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

解题
给定N个数，判断那几个数左边都是比自己小的，右边都是比自己大的，按从下到大顺序输出；
因为N最大为10^5，逐个遍历左右一定超时，所以需要复杂度为nlogn以下的算法；
动态规划——空间换时间；
建立数组保存i左边最大的数；
建立数组保存i右边最小的数；
遍历i个数，若左边最大小于i，右边最小大于i，则i加入结果数组；
最后排序结果数组，输出即可；

注意点
若结果数组为空，需要输出0换行，然后再输出换行；
MAXL的初始化为第1个数，MINR的初始化为第N个