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 (≤105). Then the next line contains N distinct positive integers no larger than 109. 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
解题思路:
这道题其实于快排没有任何关系,其实就是告诉你有一个序列,如果一个数的左边的所有数都比它小、右边的所有数都比它大,那么诚这个数为序列的一个“主元”,要你求这个序列中的主元个数。
首先我们得明确每判断一个数都去遍历一下其左右一定会超时,那么我们可以用两个数组分别存储所有位置其左右分别最大和最小的数是多少,然后最后再用一个数组保存主元的结果。
#include<iostream>
#include<algorithm>
using namespace std;
#define maxn 100010
#define inf 0x3fffffff
int num[maxn], leftmax[maxn], rightmin[maxn], res[maxn], cnt = 0;
int main()
{
int n;
cin >> n;
for (int i = 0; i < n; i++)
{
cin >> num[i];
}
leftmax[0] = 0; //num[0]的左边没有比它大的数
rightmin[n - 1] = inf; //num[n-1]的右边没有比它小的数
for (int i = 1; i < n; i++)
{
leftmax[i] = max(leftmax[i - 1], num[i - 1]);
}
for (int i = n - 2; i >= 0; i--)
{
rightmin[i] = min(rightmin[i + 1], num[i + 1]);
}
for (int i = 0; i < n; i++)
{
if (leftmax[i]<num[i] && rightmin[i]>num[i])
{
res[cnt++] = num[i];
}
}
cout << cnt << endl;
for (int i = 0; i < cnt; i++)
{
cout << res[i];
if (i < cnt - 1)
cout << " ";
}
cout << endl;
return 0;
}