1101. Quick Sort (25)
There is a classical process named partition in the famous quick sort algorithm. In this process we typically choose one element as the pivot. Then the elements less than the pivot are moved to its left and those larger than the pivot to its right. Given N distinct positive integers after a run of partition, could you tell how many elements could be the selected pivot for this partition?
For example, given N = 5 and the numbers 1, 3, 2, 4, and 5. We have:
- 1 could be the pivot since there is no element to its left and all the elements to its right are larger than it;
- 3 must not be the pivot since although all the elements to its left are smaller, the number 2 to its right is less than it as well;
- 2 must not be the pivot since although all the elements to its right are larger, the number 3 to its left is larger than it as well;
- and for the similar reason, 4 and 5 could also be the pivot.
Hence in total there are 3 pivot candidates.
Input Specification:
Each input file contains one test case. For each case, the first line gives a positive integer N (<= 105). Then the next line contains N distinct positive integers no larger than 109. The numbers in a line are separated by spaces.
Output Specification:
For each test case, output in the first line the number of pivot candidates. Then in the next line print these candidates in increasing order. There must be exactly 1 space between two adjacent numbers, and no extra space at the end of each line.
Sample Input:
5
1 3 2 4 5Sample Output:
3
1 4 5 #include<stdio.h>
#include<string>
#include<iostream>
#include<string.h>
#include<sstream>
#include<vector>
#include<map>
using namespace std;
bool is[];
int main()
{
int n;
int MAX = -,MIN = ,tem;
vector<int> vv,re;
scanf("%d",&n);
for(int i = ;i <n;++i)
{
scanf("%d",&tem);
if(tem > MAX)
{
is[i] = ;
MAX = tem;
}
vv.push_back(tem);
}
for(int i = n-;i >=;--i)
{
if(vv[i] < MIN)
{
MIN = vv[i];
if(is[i]) re.push_back(vv[i]);
}
else is[i] = ;
}
printf("%d\n",re.size());
for(int i = re.size() - ;i >= ;--i)
{
if(i == re.size() - ) printf("%d",re[i]);
else printf(" %d",re[i]);
}
printf("\n");
return ;
}
最新文章
- Loadrunner监控Linux系统资源
- final static 深度解析
- Windows环境下Sybase12.5 图文安装教程
- 【转】apache与tomcat的区别
- CodeForces152C——Pocket Book(排列组合问题)
- Codeforces Round #263 (Div. 1) C. Appleman and a Sheet of Paper 树状数组暴力更新
- xheditor在线编辑器的使用
- DefaultResouceLoader的设计
- 帝国cms7.0整合百度编辑器ueditor教程
- JavaScript事件与例子
- 1.ElasticSearch介绍及基本概念
- Mac_OS_Sierra_10.12.6编译OpenJDK9
- 转载:lua中switch
- HTTP中GET和POST的区别主要是那些,面试中可以加分的该说那些?
- 英特尔神经棒使用入门-NCS2 &; NCS1 -OpenVino
- .NET 控制Windows文件和目录访问权限研究(FileSystemAccessRule)
- link 和@import 的区别
- Vue2 dist 目录下各个文件的区别
- phpstudy + dvws
- ZJOI 2015 幻想乡战略游戏(动态点分治)