A1101. Quick Sort
来源:互联网 发布:vmware for ubuntu 编辑:程序博客网 时间:2024/05/01 17:14
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:
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:51 3 2 4 5Sample Output:
31 4 5
#include<cstdio>#include<algorithm>using namespace std;const int maxn = 1e5 + 10;const int INF = 0x7fffffff;int a[maxn],leftMax[maxn]; //数组a为序列元素, 数组left[i]为0 ~ i - 1中最大的元素int ans[maxn];//数组ans存储主元结果,count计数int main(){int count = 0, i, n, rightMin = INF;scanf("%d", &n);for(i = 1; i <= n; ++i){scanf("%d", &a[i]);leftMax[i] = max(leftMax[i - 1], a[i - 1]);}a[n + 1] = INF;for(i = n; i; --i){ //rightMin记录每次指针右边所有元素的最小值rightMin = min(rightMin, a[i + 1]);if(a[i] > leftMax[i] && a[i] < rightMin){ans[count++] = a[i];}}printf("%d\n", count);sort(ans, ans + count);for(i = 0; i < count; ++i)printf("%s%d", i ? " " : "", ans[i]);printf("\n");return 0;}
- A1101. Quick Sort (25)
- A1101. Quick Sort (25)
- A1101. Quick Sort
- PAT A1101. Quick Sort
- PAT A1101.Quick Sort
- pat-a1101. Quick Sort (25)
- PAT A1101. Quick Sort (25)
- PAT A1101 quick sort (25)
- Quick Sort
- Quick Sort
- quick sort
- quick sort
- quick sort
- Quick Sort
- Quick Sort
- quick sort
- Quick Sort
- Quick Sort
- MySQL 使用 innobackupex 备份连接服务器失败
- Deep Compression, Song Han, Caffe 实现
- Android中OKHttp框架的使用
- 如何安装IntelliJ IDEA
- 工作小记~~~使用LinearLayout实现仿ListView(解决嵌套ListView显示不全)
- A1101. Quick Sort
- 【HDU2896】病毒侵袭(AC自动机)
- javaWeb学习(三)
- IoT的那些操作系统
- Java多线程学习(吐血超详细总结)
- 【Html基础】之<h1>~<h6> <p> <br> <hr>
- Java提高篇(二六)-----hashCode
- linux 配置nginx https 访问认证
- U盘