Codeforces #269 (Div. 2) B. MUH and Important Things（水题：麻烦）

最新推荐文章于 2022-07-13 02:01:45 发布

殷华

最新推荐文章于 2022-07-13 02:01:45 发布

阅读量468

点赞数

分类专栏：基础

本文链接：https://blog.csdn.net/u011639256/article/details/39597803

版权

基础专栏收录该内容

106 篇文章 0 订阅

订阅专栏

判断给定的序列是否存在3个对下标的排列，使得对应数值保持递增

写的比较繁琐，代码如下：

#include <bits/stdc++.h>
#define MAXN 10000
using namespace std;

struct P {
    int v, t;
} a[MAXN];

int b[MAXN], c[MAXN];
int ans1[MAXN], ans2[MAXN];

bool cmp(P a, P b) {
    return a.v < b.v;
}

int main(void) {
    int n, cnt, sum, maxb;
    scanf("%d", &n);
    for(int i=0; i<n; ++i) {
        scanf("%d", &a[i].v);
        a[i].t = i;
    }
    sort(a, a+n, cmp);

    bool ok = false;
    sum = 1; maxb = -1;
    cnt = 0; b[0] = 1;
    for(int i=0; i<n; ++i) {
        if(a[i].v == a[i+1].v)
            b[i+1] = b[i]+1;
        else {
            sum *= b[i];
            if(sum > 2) {
                ok = true;
                sum = 0;
            }
            b[i+1] = 1;
        }
        maxb = max(maxb, b[i]);
    }

    if(!ok)
        puts("NO");
    else { 
        puts("YES");
        for(int i=0; i<n; ++i) {
            printf("%d ", a[i].t+1);
        }
        puts("");
        if(maxb == 2) {
            bool flag = true;
            for(int i=0; i<n; ++i) {
                if(b[i] == 2 && flag) {
                    ans1[i] = a[i-1].t;
                    ans1[i-1] = a[i].t;
                    flag = false;
                }
                else ans1[i] = a[i].t;
            }

            flag = false;
            for(int i=0; i<n; ++i) {
                if(b[i] > 1 && flag) {
                    ans2[i] = a[i-1].t;
                    ans2[i-1] = a[i].t;
                    flag = false;
                } else if(b[i] > 1) {
                    flag = true;
                    ans2[i] = a[i].t;
                } else ans2[i] = a[i].t;
            }

            for(int i=0; i<n; ++i)
                printf("%d ", ans1[i]+1);
            puts("");
            for(int i=0; i<n; ++i)
                printf("%d ", ans2[i]+1);

        } else {
            bool flag  = true;
            for(int i=0; i<n; ++i) {
                if(b[i] > 2 && flag) {
                    ans1[i] = a[i-1].t;
                    ans1[i-1] = a[i-2].t;
                    ans1[i-2] = a[i].t;
                    ans2[i] = a[i-2].t;
                    ans2[i-1] = a[i].t;
                    ans2[i-2] = a[i-1].t;
                    flag = false;
                } else {
                    ans1[i] = a[i].t;
                    ans2[i] = a[i].t;
                }
            }
            for(int i=0; i<n; ++i) {
                printf("%d ", ans1[i]+1);
            }
            puts("");
            for(int i=0; i<n; ++i)
                printf("%d ", ans2[i]+1);
        }
    }
    return 0;
}