【PAT甲级】1101 Quick Sort（DP）

两个关键点：
1：X是分界点的条件
2：递推得到L[i]和R[i]

#include <bits/stdc++.h>

using namespace std;

const int N = 100010, INF = 0x3f3f3f3f;
int n, a[N];
int l[N], r[N];

int main()
{
	cin >> n;
	for(int i = 1; i <= n; i++) cin >> a[i];
	for(int i = 1; i <= n; i++)	l[i] = max(l[i - 1], a[i]);
	r[n + 1] = INF;
	for(int i = n; i >= 1; i--) r[i] = min(r[i + 1], a[i]);
	
	vector<int> num;
	for(int i = 1; i <= n; i++)
		if(l[i - 1] < a[i] && r[i + 1] > a[i])
			num.push_back(a[i]);
	
	cout << num.size() << endl;
	if(num.size() == 0) cout << endl;
	else
	{
		cout << num[0];
		for(int i = 1; i < num.size(); i++) cout << ' ' << num[i];
		cout << endl;
	}
}