#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
int main()
{
int n ;
cin >> n ;
int nums[n];
for(int i = 0 ; i < n ; i ++)
cin >> nums[i];
vector<int> vec1 , vec2;
vec1.push_back(nums[0]);
vec2.push_back(nums[n - 1]);
int max_vec1 = nums[0] , min_vec2 = nums[n - 1];
for(int i = 1 ; i < n ; i ++)
{
if(nums[i] > max_vec1)
{
max_vec1 = nums[i];
vec1.push_back(nums[i]);
}
}
for(int i = n - 1 ; i >= 0 ; i --)
{
if(nums[i] < min_vec2)
{
min_vec2 = nums[i];
vec2.push_back(nums[i]);
}
}
reverse(vec2.begin() , vec2.end());
/*for(auto v : vec1) cout << v << ' ';
cout << endl;
for(auto v : vec2) cout << v << ' ';*/
vector<int> res;
int a = 0 ,b = 0;
while(a < vec1.size() && b < vec2.size())
{
if(vec1[a] == vec2[b])
{
res.push_back(vec1[a]);
a ++ ;
b ++ ;
}
else if(vec1[a] < vec2[b]) a ++;
else if(vec1[a] > vec2[b]) b ++;
}
cout << res.size() << endl;
if(res.size())
{
cout << res[0];
for(int i = 1 ; i < res.size() ; i ++) cout << ' ' << res[i];
}
else cout << endl;
return 0;
}
PAT 甲级1101 Quick Sort (25分)
最新推荐文章于 2024-09-25 10:19:07 发布