Educational Codeforces Round 107 (Rated for Div. 2) C. Yet Another Card Deck

最新推荐文章于 2022-06-23 23:52:59 发布

【杰杰】

最新推荐文章于 2022-06-23 23:52:59 发布

阅读量111

点赞数

分类专栏： cf

本文链接：https://blog.csdn.net/p15008340649/article/details/115775206

版权

cf 专栏收录该内容

58 篇文章 0 订阅

订阅专栏

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.

思路：

由于ai最大仅有50，所以我们可以直接找到1到50的数在序列中的最前面的位置（如果有的话），并将其放入一个新的数组，同时用vis标记这个数的位置，之后直接模拟便可。

#include<bits/stdc++.h>
#define ll long long
using namespace std;
int a[300010];
int vis[100];
int d[100];
int b[100];

int main()
{
	int n,q;
	cin>>n>>q;
	memset(vis,100,sizeof(vis));
	for(int i = 1; i <= n; i++)
	{
		scanf("%d",&a[i]);
		vis[a[i]] = min(vis[a[i]],i);
	}
	int cnt = 1;
	for(int i = 1; i <= n; i++)
	{
		if(i == vis[a[i]])
		{
			b[cnt++] = a[i];
		}
	}
	
	while(q--)
	{
		int k;
		int num = 0;
		scanf("%d",&k);
		int flag = 0;
		for(int i = 1; i < cnt; i++)
		{
			if(b[i] == k)
			{
				flag = i;
				num = k;
				break;
			}
		}
		printf("%d ",vis[b[flag]]);
		vis[b[flag]] = 1;
		for(int i = 1; i < flag; i++)
		{
			vis[b[i]]++;
		}
		for(int i = flag; i > 1; i--)
		{
			b[i] = b[i-1];
		}
		b[1] = num;
	}
}