The Second Run of Quicksort

代码

#include<iostream>
#include<vector>
#include<cstdio>
using namespace std;
const int maxn = 100010;
vector<int> sequence;
int maxL, minR, cnt, k, n, tmp;
bool bigger[maxn];
bool pivot[maxn];
int main()
{
    cin >> k;
    while (k--)
    {
        scanf("%d", &n);
        sequence.clear();
        for (int i = 0; i < n; i++)
        {
            scanf("%d", &tmp);
            sequence.emplace_back(tmp);
        }
        fill(bigger, bigger + n, false);
        fill(pivot, pivot + n, false);
        maxL = -1, minR = 0x3fffffff;
        cnt = 0;
        for (int i = 0; i < n; i++)
        {
            if (sequence[i] > maxL)
            {
                bigger[i] = true;
                maxL = sequence[i];
            }
        }
        for (int i = n - 1; i >= 0; i--)
        {
            if (bigger[i] && sequence[i] < minR)
            {
                cnt++;
                pivot[i] = true;
                if (cnt == 3) break;
            }
            if (sequence[i] < minR)minR = sequence[i];
        }
        if (cnt >= 3) cout << "Yes" << endl;
        else if (cnt == 2 && (pivot[0] || pivot[n - 1]))cout << "Yes" << endl;
        else cout << "No" << endl;

    }
}

__EOF__

本文作者：WangZhenHui
本文链接：https://www.cnblogs.com/index-12/p/17341224.html
关于博主：评论和私信会在第一时间回复。或者直接私信我。
版权声明：本博客所有文章除特别声明外，均采用 BY-NC-SA 许可协议。转载请注明出处！
声援博主：如果您觉得文章对您有帮助，可以点击文章右下角【推荐】一下。您的鼓励是博主的最大动力！