1101 Quick Sort (25 分)难度: 一般 / 知识点: 快排

Posted 2021-12-16 辉小歌

https://pintia.cn/problem-sets/994805342720868352/problems/994805366343188480
PAT乙级原题。。。

#include<cstdio>
#include<iostream>
#include<algorithm>
#include<vector>
using namespace std;
const int N=1e5+10;
int a[N],b[N];
vector<int>ans;
int main(void)

	int n; cin>>n;
	for(int i=0;i<n;i++) cin>>a[i],b[i]=a[i];
	sort(b,b+n);
	int temp=-9999; 
	for(int i=0;i<n;i++)
	
		if(a[i]==b[i]&&a[i]>=temp) ans.push_back(a[i]);
        temp=max(temp,a[i]);
	
	cout<<ans.size()<<endl;
	for(int i=0;i<ans.size();i++) 
	
		cout<<ans[i];
		if(i+1!=ans.size()) cout<<" ";
	
    cout<<endl;
	return 0;