zoukankan      html  css  js  c++  java
  • 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 (≤). Then the next line contains N distinct positive integers no larger than 1. 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 <vector>
    #include <algorithm>
    using namespace std;
    int main(){
        vector<int> res;
        int N, Max = -1;
        cin >> N;
        int arr[N], cp[N];
        for(int i = 0; i < N; i++) {
            cin >> arr[i];
            cp[i] = arr[i];
        }
        sort(cp, cp+N);
        for(int i = 0; i < N; i++){
            if(cp[i] == arr[i] && arr[i] > Max)
                res.push_back(arr[i]);
            if(arr[i] > Max) Max = arr[i];
        }
        printf("%d
    ",res.size());
        for(int i = 0; i < res.size(); i++)
            if(i != res.size() - 1) printf("%d ", res[i]);
            else printf("%d", res[i]);
        printf("
    ");
        return 0;
    }
  • 相关阅读:
    Zuul token FIlter 验证失败结果输出
    springboot 使用 dev tool 导致 CastException
    索引失效的情况汇总
    JVM笔记-GC常用参数设置
    关于gdb和shp的FID问题
    配置mac百度云同步盘
    【python常用函数1】
    【python环境配置1】 环境变量与常用模块
    【nodejs笔记——小知识点汇总】
    ArcGIS标注
  • 原文地址:https://www.cnblogs.com/littlepage/p/12900549.html
Copyright © 2011-2022 走看看