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
题意:给出一组数据,问你其中可能作为快排枢轴的元素有哪些,按序输出这些元素。
思路: 快排的枢轴有如下特征,该元素左边的数据均小于等于它,右边的元素均大于等于它。因此可以做两个数组,lMax和rMin,分别保存该元素左边的最大值和右边的最小值,然后依次判断是否满足如上特征,最后把符合条件的元素按顺序输出。
注意lMax数组赋初值0,rMin数组赋初值inf(最大值)。
参考代码:
#include<cstdio>
#include<vector>
#include<algorithm>
using namespace std;
const int maxn=100010;
const int inf=(1<<30);
int n,lMax[maxn],rMin[maxn],a[maxn];
vector<int> ans;
int main()
{
scanf("%d",&n);
for(int i=0;i<n;i++)
scanf("%d",&a[i]);
fill(rMin,rMin+n,inf);
for(int i=1;i<n;i++){
lMax[i]=max(lMax[i-1],a[i-1]);
}
for(int i=n-2;i>=0;i--){
rMin[i]=min(rMin[i+1],a[i+1]);
}
for(int i=0;i<n;i++){
if(a[i]>=lMax[i]&&a[i]<=rMin[i])
ans.push_back(a[i]);
}
printf("%d\n",ans.size());
sort(ans.begin(),ans.end());
for(int i=0;i<ans.size();i++){
if(i!=0) printf(" ");
printf("%d",ans[i]);
}
printf("\n");
return 0;
}