(PAT 1101)Quick Sort (递推法)

发布时间:2023-05-19 09:18:31

There is a classical process namedpartitionin 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. GivenNdistinct positive integers after a run of partition, could you tell how many elements could be the selected pivot for this partition?

For example, givenN=5and 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 integerN(≤105). Then the next line containsNdistinct positive integers no larger than109. 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:
51 3 2 4 5
Sample Output:
31 4 5






#include <iostream>#include <algorithm>#include <vector>using namespace std;const int MAXN = 100010;long int numbers[MAXN];long int forwards[MAXN];long int backs[MAXN];int  N;int main() {scanf("%d", &N);for (int i = 0; i < N; ++i) {scanf("%d", &numbers[i]);}//正推int biggest = numbers[0];forwards[0] = numbers[0];for (int j = 1; j < N; ++j) {forwards[j] = forwards[j - 1];  ///推if (numbers[j] > biggest) {biggest = numbers[j];forwards[j] = biggest;}}//逆推int smallest = numbers[N - 1];backs[N-1] = numbers[N - 1];for (int k = N - 2; k >= 0; --k) {backs[k] = backs[k+1];if (numbers[k] < smallest) {smallest = numbers[k];backs[k] = smallest;}}vector<long int> res;for (int i = 0; i < N; ++i) {if (numbers[i] >= forwards[i] && numbers[i] <= backs[i]) {res.push_back(numbers[i]);}}  cout << res.size() << endl;for (int i = 0; i < res.size(); ++i) {cout << res[i];if(i < res.size()-1){  cout<<" ";}}cout<<endl;  //必须换行return 0;}

ps 图灵课堂老师从近一百套最新一线互联网公司面试题中精选而出,涵盖Java架构面试 所有技术栈,包括JVM,Mysql,并发,Spring,Redis,MQ,Zookeeper,Netty, Dubbo,Spring Boot,Spring Cloud,数据结构与算法,设计模式等相关技术领域的大 厂面试题及详解。 详情咨询客服获取全套面经试题。

上一篇 (PAT)1032 Sharing (可以用数组表示地址)
下一篇 怎么理解回调函数? 回调函数合集