#include <iostream>
#include <vector>
#include <string>
#include <stdlib.h>
#include <math.h>
#include <sstream>
#include <map>
#include <set>
#include <algorithm>
using namespace std;
int main(void)
{
long long N;
cin>>N;
vector<long long> arr;
vector<long long> lmax;
vector<long long> rmin;
lmax.assign(N,-1);
rmin.assign(N,0);
for(long long i=0;i<N;i++)
{
long long itemp;
cin>>itemp;
arr.push_back(itemp);
}
if(N==1)
{
cout<<1<<endl;
cout<<arr[0]<<endl;
return 0;
}
long long maxvalue = arr[0];
for(long long i=0;i<N;i++)
{
if(arr[i]>maxvalue)
{
maxvalue = arr[i];
lmax[i]=maxvalue;
}
else
lmax[i]=maxvalue;
}
long long minvalue = arr[N-1];
for(long long i=N-1;i>=0;i--)
{
if(arr[i]<minvalue)
{
minvalue = arr[i];
rmin[i]=minvalue;
}
else
rmin[i]=minvalue;
}
long long count=0;
vector<long long> pivots;
for(long long i=0;i<N;i++)
{
if(i==0 && arr[i]<rmin[i+1])
{
pivots.push_back(arr[i]);
count++;
}
else if(i==N-1 && arr[i]>lmax[i-1])
{
pivots.push_back(arr[i]);
count++;
}
else if( i>0 && i<N && arr[i]> lmax[i-1] && arr[i]< rmin[i+1])
{
pivots.push_back(arr[i]);
count++;
}
}
cout<<count<<endl;
if(count ==0 )
{
cout<<endl;
return 0;
}
else
{
for(long long k=0;k<count-1;k++)
{
cout<<pivots[k]<<" ";
}
cout<<pivots[count-1]<<endl;
}
return 0;
}
[PAT]1101. Quick Sort (25)
最新推荐文章于 2021-02-19 14:43:42 发布