1101. Quick Sort
2015-11-09 19:44
579 查看
1101. Quick Sort (25)
时间限制200 ms内存限制65536 kB代码长度限制16000 B判题程序Standard作者CAO, PengThere 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 numbersin 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<iostream>#include<stdio.h>#include<algorithm>using namespace std;const int N = 100002;int main(){int n;int dp1, dp2, buf;bool mark;scanf("%d", &n);for(int i = 1; i <= n; i ++){int tmp;scanf("%d", &tmp);buf[i] = tmp;dp1[i] = dp2[i] = tmp;mark[i] = false;}dp1[0] = -0x7fffffff;dp2[n+1] = 0x7fffffff;for(int i = 2; i <= n; i ++)dp1[i] = max(dp1[i], dp1[i-1]);for(int i = n-1; i >= 0; i --)dp2[i] = min(dp2[i], dp2[i+1]);for(int i = 1; i <= n; i ++)if(buf[i] > dp1[i-1] && buf[i] < dp2[i+1])mark[i] = true;int ans = 0;for(int i = 1; i <= n; i ++)if(mark[i])ans ++;printf("%d\n", ans);for(int i = 1; i <= n; i ++){static bool flag = true;if(mark[i]){if(flag){printf("%d", buf[i]);flag = false;}elseprintf(" %d", buf[i]);}}printf("\n");return 0;}[/code]
相关文章推荐
- HDU 4296 Buildings(贪心)
- iOS 如何获取系统的个人热点,进行配置UI
- webservice报错Message part refundRequest was not recognized. (Does it exist in service WSDL?)
- easyUi在后台加载异步树
- UIGestureRecognizer(高级)
- UIAlertView弹出框的简单使用
- 关于Intellij IDEA菜单项中Compile、Make和Build的区别
- How Did Watson Answer? —— About Question Analysis
- UIView 杂记
- UI设计工具
- 【转】jmeter 进行java request测试
- 自定义UICollectionViewFlowLayout
- easyui-combobox 取值问题
- UIButton 的属性与方法
- NQueens 与 递归,回溯
- androidUI——PopWindow
- IOS UITest 初始化 ViewController
- 自定义 UIButton(图片+文字)
- 使用values文件夹dimens文件做适配的一点想法
- iOS小技巧-UINavigationItem代码设置导航栏返回按钮的字体