zoukankan      html  css  js  c++  java
  • 1101 Quick Sort (25 分)

    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<string>
    #include<vector>
    #include<string>
    #include<cstdio>
    #include<cmath>
    #include<string.h>
    #include<algorithm>
    #include<map>
    using namespace std;
    
    
    
    int main()
    {
        int n;
        scanf("%d",&n);
        int a[n];
        int b[n];
        for(int i=0;i<n;i++)
        {
            scanf("%d",&a[i]);
            b[i]=a[i];
        }
        sort(b,b+n);
        int cnt=0;
        vector<int> res;
        int maxV=a[0];
        for(int i=0;i<n;i++)
        {
            if(a[i]==b[i]&&a[i]>=maxV)
            {
                 cnt++;
                 res.push_back(a[i]);
            }
            maxV=max(maxV,a[i]);
        }
        if(cnt==0)
        {
            printf("0");
            return 0;
        }
        printf("%d
    ",cnt);
        if(cnt>0)
            printf("%d",res[0]);
        for(int i=1;i<res.size();i++)
            printf(" %d",res[i]);
        return 0;
    }
     
  • 相关阅读:
    时间相关
    mongodb数据库怎么迁移
    删除项目中所有的__pycache__ 文件
    获取请求参数
    Linux VIM python 自动补全插件:pydiction
    Linux的环境变量.bash_profile .bashrc profile文件
    Linux下查看CPU型号,内存大小,硬盘空间的命令(详解)
    python3的一些文件操作的脚手架
    Python time strptime()方法 时间操作
    我看《架构漫谈》——1
  • 原文地址:https://www.cnblogs.com/zhanghaijie/p/10376519.html
Copyright © 2011-2022 走看看