#include <iostream>
#include <algorithm>
#include <vector>
int v[100000];
using namespace std;
int main() {
int n, max = 0, cnt = 0;
cin>>n;
vector<int> a(n), b(n);
for (int i = 0; i < n; i++) {
scanf("%d", &a[i]);
b[i] = a[i];
}
sort(a.begin(), a.end());
for (int i = 0; i < n; i++) {
if(a[i] == b[i] && b[i] > max) //左边的数都比他小,右边的都比他大则和按序后的位置一样
v[cnt++] = b[i];
if (b[i] > max)
max = b[i];
}
printf("%d\n", cnt);
for(int i = 0; i < cnt; i++) {
if (i != 0) printf(" ");
cout<<v[i];
}
printf("\n");
system("pause");
return 0;
}
1045 快速排序 (25 分)
最新推荐文章于 2022-10-30 11:42:47 发布