308389: CF1511C. Yet Another Card Deck
Memory Limit:256 MB
Time Limit:2 S
Judge Style:Text Compare
Creator:
Submit:0
Solved:0
Description
Yet Another Card Deck
题意翻译
有 $n$ 张卡片从高到低叠放在桌子上,最上面的编号为 $1$,最下面的编号为 $n$。第 $i$ 张卡片的颜色为 $a_i$。 现在你需要执行 $q$ 次操作,第 $i$ 次操作对应的操作码为 $t_i$。需要执行三步操作: - 找到最高的颜色为 $t_i$ 的卡片(即编号最小的) - 输出这张卡片当前编号 - 将其抽出来放到所有卡片的最上面(这一步后有些卡片的编号可能会发生改变) 数据范围见原题面题目描述
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 $ a_i $ . You should process $ q $ queries. The $ j $ -th query is described by integer $ t_j $ . For each query you should: - find the highest card in the deck with color $ t_j $ , 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.输入输出格式
输入格式
The first line contains two integers $ n $ and $ q $ ( $ 2 \le n \le 3 \cdot 10^5 $ ; $ 1 \le q \le 3 \cdot 10^5 $ ) — the number of cards in the deck and the number of queries. The second line contains $ n $ integers $ a_1, a_2, \dots, a_n $ ( $ 1 \le a_i \le 50 $ ) — the colors of cards. The third line contains $ q $ integers $ t_1, t_2, \dots, t_q $ ( $ 1 \le t_j \le 50 $ ) — the query colors. It's guaranteed that queries ask only colors that are present in the deck.
输出格式
Print $ q $ integers — the answers for each query.
输入输出样例
输入样例 #1
7 5
2 1 1 4 3 3 1
3 2 1 1 4
输出样例 #1
5 2 3 1 5