#include<cstdio>
#include<vector>
#include<iostream>
#include<algorithm>
using namespace std;
const int maxn=100010;
int origin[maxn],a[maxn];
vector<int> ans;
int main()
{
int n;
cin>>n;
for(int i=0;i<n;i++)
{
scanf("%d",&origin[i]);
a[i]=origin[i];
}
sort(a,a+n);
int max=-1;
for(int i=0;i<n;i++)
{
if(origin[i]>max&&origin[i]==a[i])
ans.push_back(origin[i]);
if(origin[i]>max)
max=origin[i];
}
printf("%d\n",ans.size());
for(int i=0;i<ans.size();i++)
{
printf("%d",ans[i]);
if(i!=ans.size()-1)
printf(" ");
}
printf("\n");
}
A1101 Quick Sort (25) 快速排序 (4.7节内容)
最新推荐文章于 2022-11-05 20:17:39 发布