1101. Quick Sort (25)-PAT甲级真题
来源:互联网 发布:金融数据建模招聘 编辑:程序博客网 时间:2024/05/16 09:31
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 5
Sample Output:
3
1 4 5
#include <iostream>#include <cstdio>#include <algorithm>#include <vector>int a[100000], b[100000];using namespace std;int main() { int n; scanf("%d", &n); for (int i = 0; i < n; i++) { scanf("%d", &a[i]); b[i] = a[i]; } sort(a, a + n); int v[100000]; int max = 0; int cnt = 0; for (int i = 0; i < n; i++) { if(a[i] == b[i] && b[i] > max) { v[cnt++] = b[i]; } if (b[i] > max) max = b[i]; } printf("%d\n", cnt); for(int i = 0; i < cnt; i++) if(i == 0) printf("%d", v[i]); else printf(" %d", v[i]); printf("\n");//不加这句竟然有一个测试点没法通过。。醉了。。 return 0;}
- 1101. Quick Sort (25)-PAT甲级真题
- PAT 甲级 1101. Quick Sort (25)
- [转]PAT甲级练习1101. Quick Sort (25)
- PAT-甲级 1101 Quick Sort
- 1045.快速排序(25) PAT 乙级&&1101. Quick Sort (25)PAT甲级
- PAT 1101. Quick Sort (25)
- [PAT]1101. Quick Sort (25)
- 【PAT】1101. Quick Sort (25)
- PAT 1101. Quick Sort (25)
- pat 1101. Quick Sort (25)
- PAT 1101. Quick Sort (25)
- PAT 1101. Quick Sort (25)
- pat 1101. Quick Sort (25)
- PAT--1101. Quick Sort
- 【PAT】1101. Quick Sort
- 1098. Insertion or Heap Sort (25)-PAT甲级真题(堆排序)
- 1067. Sort with Swap(0,*) (25)-PAT甲级真题(贪心算法)
- PAT-A 1101. Quick Sort (25)
- AsyncTask-异步任务
- Android权限之sharedUserId和签名 .
- 1104. Sum of Number Segments (20)-PAT甲级真题
- UVA - 10494 If We Were a Child Again
- UVA - 10106 Product
- 1101. Quick Sort (25)-PAT甲级真题
- UVA - 101 The Blocks Problem
- RISC诞生与发展的缩影
- 获取缓存大小和清除缓存功能
- AndroidStudio设置三步走
- Android--多媒体
- UVA - 133 The Dole Queue
- Java链栈
- 2016.07.08【初中部 NOIP提高组 】模拟赛C