【PAT】A1101 Quick Sort 易错点

PAT-A1101 Quick Sort 易错点

题目

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 (≤10​^5). Then the next line contains N distinct positive integers no larger than 10​^9. 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.

参考答案

#include <iostream>

using namespace std;

int main()
{
    int n =0;
    scanf("%d",&n);
    int nums[n] = {0};
    for(int i=0;i<n;++i){
        scanf("%d",&nums[i]);
    }

    int res[n]={0};
    int ans=0;
    int leftmax[n];
    int rightmin[n];

    //打表
    int leftpointer = 1;
    leftmax[0]=nums[0];
    while(leftpointer<=n-1){
        if(leftmax[leftpointer-1]<nums[leftpointer])
            leftmax[leftpointer]=nums[leftpointer];
        else
            leftmax[leftpointer] = leftmax[leftpointer-1];
        leftpointer++;
    }
//  与上面功能相同的简化版
//    int temp = -1;
//    for(int i = 0;i<n;++i){
//        if (nums[i]>temp)
//            temp = nums[i];
//        leftmax[i]=temp;
//    }

    int rightpointer = n-2;
    rightmin[n-1] = nums[n-1];
    while(rightpointer>=0){
        if(rightmin[rightpointer+1]>nums[rightpointer])
            rightmin[rightpointer] = nums[rightpointer];
        else
            rightmin[rightpointer] = rightmin[rightpointer+1];
        rightpointer--;
    }
// 与上面功能相同的简化版
//    temp = 0x3fffffff;
//    for(int i=n-1;i>=0;--i){
//        if(nums[i]<temp)
//            temp = nums[i];
//        rightmin[i]=temp;
//    }

    for(int i=0;i<=n-1;++i){
        if(nums[i]==leftmax[i] && nums[i]==rightmin[i])
            res[ans++]=nums[i];
    }

    printf("%d\n",ans);  //由于ans++，这里本来需要减1，但是ans表示的是下标，当表示长度是又加1，所以这里不变。
    for(int i=0;i<ans;++i){
        printf("%d",res[i]);
        if(i<ans-1)
            printf(" ");        
	}
	
//错误示范：
//如果最后一个值后面没有空格，不能用下面这种处理方法，应该向上面那样在for里面处理，否则出错。   
//在这里如果注释掉这个if，把下面的printf解注释，并使用i<ans-1，则第二个测试用例报错。
//为什么错，俺也不懂。
//for(int i=0;i<ans-1;++i){
//        printf("%d ",res[i]);     
//}
//printf("%d",res[ans-1]);

	printf("\n");               //这个输出很重要
    return 0;
}