[转]PAT甲级练习1101. Quick Sort (25)
来源:互联网 发布:哪个软件足球比赛录像 编辑:程序博客网 时间:2024/06/05 20:45
http://www.liuchuo.net/archives/1917
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 <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;}
PS. 100之后的题目就不转载了,去这个小姐姐那里看好了,真的来不及了。。。http://www.liuchuo.net/pat%E7%94%B2%E7%BA%A7%E9%A2%98%E8%A7%A3%E7%9B%AE%E5%BD%95
- [转]PAT甲级练习1101. Quick Sort (25)
- PAT 甲级 1101. Quick Sort (25)
- 1101. Quick Sort (25)-PAT甲级真题
- PAT-甲级 1101 Quick Sort
- [转]PAT甲级练习1098. Insertion or Heap Sort (25)
- 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
- PAT甲级练习1067. Sort with Swap(0,*) (25)
- PAT-A 1101. Quick Sort (25)
- Pull解析XML文件
- 常见Linux命令整理
- 题目集合1
- 【leetcode】312. Burst Balloons
- socket缓冲区
- [转]PAT甲级练习1101. Quick Sort (25)
- 2016湘潭邀请赛 xtu1250
- Android学习之Java基础篇day7
- mysql------>使用cmd打开my sql
- 【leetcode】312. Burst Balloons
- android之事件分发机制
- 二叉树已知前序,中序,求后序
- 【002】链表翻转
- 团体程序设计天梯赛L3-010 是否完全二叉搜索树