快速排序

1045. 快速排序(25)

时间限制

200 ms

内存限制

65536 kB

代码长度限制

8000 B

判题程序

Standard

作者

CAO, Peng

著名的快速排序算法里有一个经典的划分过程：我们通常采用某种方法取一个元素作为主元，通过交换，把比主元小的元素放到它的左边，比主元大的元素放到它的右边。 给定划分后的N个互不相同的正整数的排列，请问有多少个元素可能是划分前选取的主元？

例如给定N = 5, 排列是1、3、2、4、5。则：

• 1的左边没有元素，右边的元素都比它大，所以它可能是主元；
  
• 尽管3的左边元素都比它小，但是它右边的2它小，所以它不能是主元；
  
• 尽管2的右边元素都比它大，但其左边的3比它大，所以它不能是主元；
  
• 类似原因，4和5都可能是主元。

  因此，有3个元素可能是主元。

  输入格式：

  输入在第1行中给出一个正整数N（<= 10⁵）； 第2行是空格分隔的N个不同的正整数，每个数不超过10⁹。

  输出格式：

  在第1行中输出有可能是主元的元素个数；在第2行中按递增顺序输出这些元素，其间以1个空格分隔，行末不得有多余空格。

  输入样例：

  5
  1 3 2 4 5
  

  输出样例：

  3
  1 4 5
  

---

提交代码

1101. Quick Sort (25)

时间限制

200 ms

内存限制

65536 kB

代码长度限制

16000 B

判题程序

Standard

作者

CAO, Peng

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⁵). Then the next line contains N distinct positive integers no larger than 10⁹. 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<stdio.h>
#include<algorithm>
using namespace std;
const int maxn=100010;
int a[maxn],leftmax[maxn],rightmin[maxn];
int main()
{
	int n;
	scanf("%d",&n);
	for(int i=0;i<n;i++)
	{
		scanf("%d",&a[i]);
	}
	leftmax[0]=a[0];
	for(int i=1;i<n;i++)
	{
		if(a[i]>leftmax[i-1])
		{
			leftmax[i]=a[i];
		}
		else
		{
			leftmax[i]=leftmax[i-1];
		}
	}
	rightmin[n-1]=a[n-1];
	for(int i=n-2;i>=0;i--)
	{
	    if(a[i]<rightmin[i+1])
	    {
	    	rightmin[i]=a[i];
		}
		else
		{
			rightmin[i]=rightmin[i+1];
		}
	}
	int b[maxn],count=0;
	if(a[0]<rightmin[1])
	{
		b[count]=a[0];
		count++;
	}
	rightmin[n]=0x7fffffff;
	for(int i=1;i<n;i++)
	{
		if(a[i]>leftmax[i-1]&&a[i]<rightmin[i+1])
		{
			b[count]=a[i];
			count++;
		}
	}
	printf("%d\n",count);
	for(int i=0;i<count;i++)
	{
		printf("%d",b[i]);
		if(i!=(count-1)) printf(" ");
	}
	printf("\n");
	
	return 0;
}