1101. Quick Sort (25)
来源:互联网 发布:php 取小数点后两位 编辑:程序博客网 时间:2024/06/06 03:53
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 <vector>#include <stdio.h>#include <algorithm>#include <iomanip>#include <string>#include <cstdio>#include <string.h>#include <set>#include <cmath>#include <map>#include <stack>#include <string.h>#include <sstream>using namespace std;typedef long long LL;//之前想用最普通的想法水题 但是超时//参考 https://www.liuchuo.net/archives/1917 妹子很萌 哈哈哈//思路是 开辟两个数组 ,如果数组a排序后的位置不变 而且 比 之前出现的数值都要大 可以证明是个pivotint a[1000000], b[1000000];int main() { //freopen("in.txt", "r", stdin); //freopen("out.txt", "w", stdout); int n; cin >> n; vector<LL> ans; //保存最后的结果 for(int i = 0; i < n; i++) { cin >> a[i]; b[i] = a[i]; } int max = 0; // 超时 // 时间复杂度O(n^2) // for(int i = 0; i < n; i++) { // for(int j = 0; j < n; j++){ // if((j != i && j < i && v[j] > v[i]) || (j != i && j > i && v[j] < v[i])){ // flag = 0; // break; // } // } // if(flag){ // ans.push_back(v[i]); // } sort(a, a + n); //时间复杂度O(n) for(int i = 0; i < n; i++) { if(a[i] == b[i] && b[i] > max) { ans.push_back(b[i]); } if(b[i] > max){ max = b[i]; } } cout << ans.size() << endl; for(int i = 0; i < ans.size(); i++) { if(i == 0) { cout << ans[i]; } else { cout << " " << ans[i]; } } cout << endl; return 0;}
- 1101. Quick Sort (25)
- 1101. Quick Sort (25)
- 1101. Quick Sort (25)
- 1101. Quick Sort (25)
- 1101. Quick Sort (25)
- 1101. Quick Sort (25)
- 1101. Quick Sort (25)
- 1101. Quick Sort (25)
- 1101. Quick Sort (25)
- 1101. Quick Sort (25)
- 1101. Quick Sort (25)
- 1101. Quick Sort (25)
- 1101. Quick Sort (25)
- 1101. Quick Sort (25)
- 1101. Quick Sort (25)
- 1101. Quick Sort (25)
- 1101.Quick Sort (25)
- 1101. Quick Sort (25)
- 【转载】SIP扩展与相关RFC介绍
- ES5中新增的Array方法详细说明
- Spring中Bean的生命周期
- 跨域+Filter+oAuth
- MySQL查询总积分前十的用户信息和总分
- 1101. Quick Sort (25)
- 【web前端】html+js实现流程进度展示条
- 爬虫记录(1)——简单爬取一个页面的内容并写入到文本中
- JSON格式自动解析遇到的调用方法问题.fromJson() ..readValue()
- 微信 静默 授权登录 获取openid 实现方法
- linux 设备驱动开发学习笔记(一):最简单的内核模块
- 【技术贴收集】在线预览下载PDF文件
- Codeforces 842 B Gleb And Pizza
- 框架:提供一定能力的小段程序