枚举--Yet Another Card Deck

最新推荐文章于 2024-07-23 22:07:33 发布

空景 Sadnes╰つ677

最新推荐文章于 2024-07-23 22:07:33 发布

阅读量294

点赞数 1

文章标签： c语言算法蓝桥杯

本文链接：https://blog.csdn.net/qq_63202674/article/details/122459481

版权

Yet Another Card Deck

You have a card deck of n cards, numbered from top to bottom, i. e. the top card has index 1 and bottom card — index n. Each card has its color: the i-th card has color ai.

You should process q queries. The j-th query is described by integer tj. For each query you should:

find the highest card in the deck with color tj, i. e. the card with minimum index;
print the position of the card you found;
take the card and place it on top of the deck.
Input
The first line contains two integers n and q (2≤n≤3⋅105; 1≤q≤3⋅105) — the number of cards in the deck and the number of queries.

The second line contains n integers a1,a2,…,an (1≤ai≤50) — the colors of cards.

The third line contains q integers t1,t2,…,tq (1≤tj≤50) — the query colors. It’s guaranteed that queries ask only colors that are present in the deck.

Output
Print q integers — the answers for each query.

Example
inputCopy
7 5
2 1 1 4 3 3 1
3 2 1 1 4
outputCopy
5 2 3 1 5
Note
Description of the sample:

the deck is [2,1,1,4,3–,3,1] and the first card with color t1=3 has position 5;
the deck is [3,2–,1,1,4,3,1] and the first card with color t2=2 has position 2;
the deck is [2,3,1–,1,4,3,1] and the first card with color t3=1 has position 3;
the deck is [1–,2,3,1,4,3,1] and the first card with color t4=1 has position 1;
the deck is [1,2,3,1,4–,3,1] and the first card with color t5=4 has position 5.

题意:两个输入分别表示接下来要输入两组数据中数量的个数，
第一个数据表示输入一组数的排列，第二组数据的每一个输入表示对第一个数据的查询查询的内容是第一组数据中排序最靠前的数的位置，并且查询完之后将其放到队首。
代码

#include <stdio.h>
#include <limits.h>
#include <string.h>
int main()
{
    int n,i,q,eveco,color[55]={0};
    scanf("%d%d",&n,&q);
    for(i=1;i<=n;i++)
 for ( i = 1; i <= n; i++)
    {//储存颜色种类对应第一次出现的位置
        scanf("%d",&eveco);
        if (color[eveco] == 0)
        {
            color[eveco] = i;
        }
    }
    int t, j ;
    for (i = 0; i < q; i++)//查找q次
    {
        scanf("%d",&t);
        printf("%d ",color[t]);//当前查找数的位置
        for( j=1;j<=50;j++)
        {
            if(j==t||!color[j])//!color[j]非零为真
                continue;
            if(color[j]<color[t])//比当前位置小的数位置加1
            color[j]++;
        }
        color[t]=1;//第一个位置为刚查找的数
    }
    return 0;
}