CSP 2021年 小熊的果籃 暴力版本

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

const int maxN = 2e5 + 5;
struct Fruit
{
    int type;
    bool hasPicked;//已被挑選過
}fruit[maxN];

int main()
{
    int n;
    scanf("%d", &n);

    for(int i = 1; i <= n; i++)
    {
        scanf("%d", &fruit[i].type);
    }

    int pickCnt = 0;
    while(pickCnt < n)
    {
        int former = -1;
        for(int i = 1; i <= n; i++)
        {
            if(!fruit[i].hasPicked && fruit[i].type != former)
            {
                fruit[i].hasPicked = true;
                pickCnt++;
                former = fruit[i].type;
                printf("%d ", i);
            }
        }
        printf("\n");
    }
    return 0;
}

 

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

const int maxN = 2e5 + 5;
struct Fruit
{
    int type;
    bool hasPicked;//已被挑選過
}fruit[maxN];

int main()
{
    int n;
    scanf("%d", &n);

    for(int i = 1; i <= n; i++)
    {
        scanf("%d", &fruit[i].type);
    }

    int pickCnt = 0;
    while(pickCnt < n)
    {
        int former = -1;
        for(int i = 1; i <= n; i++)
        {
            if(!fruit[i].hasPicked && fruit[i].type != former)
            {
                fruit[i].hasPicked = true;
                pickCnt++;
                former = fruit[i].type;
                printf("%d ", i);
            }
        }
        printf("\n");
    }
    return 0;
}