1045. 快速排序(25)

#include<cstring>#include<vector>#include<iostream>using namespace std;int main(){int n,i,j,k,count=0;int a[1000000000]={0},countl[1000000000]={0},countr[1000000000]={0};vector<char> b;cin>>n;for(i=0;i<n;i++) cin>>a[i];for(i=0;i<n;i++){for(j=0;j<i;j++){if(a[j]>=a[i]){break;}else{countl[i]++;}}for(k=i+1;k<n;k++){if(a[k]<=a[i]){break;}else{countr[i]++;}}if(countl[i]==i && countr[i]==n-i-1){b.push_back(a[i]);count++;}}cout<<count<<endl;for(i=0;i<count;i++){cout<<b[i];if(i<count-1) cout<<" ";}return 0;}