A1101 Quick Sort [统计个数]

跟A1093 有几个PAT思想一致，两个数组，一个统计从左往右最大的另一个统计从右往左最小的，然后比较注意数组赋初值的问题。

#include<iostream>
#include<cstring>
#include<algorithm>
#include<string>
#include<time.h>
using namespace std;
const int maxn = 100001;
const int inf = 1000000007;
int leftmax[maxn] = { 0 };
int rightmin[maxn];
int main()
{
	int n; int a[maxn] = { 0 };
	cin >> n;
	for (int i = 0; i < n; i++)
	{
		rightmin[i] = inf;
	}
	for (int i = 0; i < n; i++)
	{
		cin >> a[i];
		if (i > 0)
			leftmax[i] = leftmax[i - 1];
		if (a[i] > leftmax[i])
			leftmax[i] = a[i];
	}

	for (int j = n - 1; j >= 0; j--)
	{
		if (a[j] < rightmin[j])
			rightmin[j] = a[j];
		if (j > 0)
			rightmin[j-1] = rightmin[j];	
	}
	int flag = true, count = 0;
	for (int i = 0; i < n; i++)
	{
		if (a[i] >= leftmax[i] && a[i] <= rightmin[i])
			count++;
	}
	cout << count << endl;
	for (int i = 0; i < n; i++)
	{
		if (a[i] >= leftmax[i] && a[i] <= rightmin[i])
		{
			if (flag)
			{
				cout << a[i];
				flag = false;
			}
			else
			{
				cout << " " << a[i];
			}
		}
	}
	cout << endl;
	return 0;
}