1101. Quick Sort (25)

1101. Quick Sort (25)
时间限制 200 ms 内存限制 65536 kB 代码长度限制 16000 B
判题程序 Standard 作者 CAO, Peng

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

思路：
主元的话一定是 大于其所在位置左边的所有元素的最大值，小于右边所有元素的最小值（不包括本身）

注意点：

• 最小值右移30位，不能右移31，右移31的话变成了负数
• 最后一定要加一个换行（可能是特殊数据，没有主元的情况）

#define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <cstring>
#include <fstream>
#include <string>
#include <cmath>
#include <algorithm>
#include <queue>
#include <map>
using namespace std;

const int MaxN = 100010;
const int INF = 1 << 30;

int Data[MaxN] ,LeftMax[MaxN], RightMin[MaxN];
int main()
{
#ifdef _DEBUG
    freopen("data.txt", "r+", stdin);
    //fstream cin("data.txt");
#endif // _DEBUG

    int N;

    queue<int> que;
    scanf("%d", &N);

    LeftMax[0] = 0;
    RightMin[N - 1] = INF;

    for (int i = 0; i < N; ++i)
        scanf("%d", &Data[i]);

    for (int i = 1; i < N; ++i)
    {
        LeftMax[i] = max(LeftMax[i - 1], Data[i - 1]);
    }

    for (int i = N - 2; i >= 0; --i)
    {
        RightMin[i] = min(RightMin[i + 1], Data[i + 1]);
    }

    for (int i = 0; i < N; ++i)
    {
        if (LeftMax[i] <= Data[i] && Data[i] <= RightMin[i])
            que.push(Data[i]);
    }

    printf("%d\n", que.size());

    while (!que.empty())
    {
        printf("%d", que.front());
        que.pop();
        if (!que.empty())
            printf(" ");
    }
    printf("\n");


#ifdef _DEBUG
    //cin.close();
#ifndef _CODEBLOCKS
    std::system("pause");
#endif // !_CODEBLOCKS
#endif // _DEBUG

    return 0;
}