As we are currently experiencing an overwhelming number of web requests for fetching user submissions, we have temporarily disabled the full submissions list. You must now be logged in to view submissions.
给定长为 $n$ 的序列，$q$ 次询问区间 $[l,r]$ 的最短子区间 $[l',r']$，满足所有在 $[l,r]$ 中出现的数也在 $[l',r']$ 中出现. 你只需要输出 $[l',r']$ 的长度 $r'-l'+1$。
第一行一个正整数 $n$。
接下来一行有 $n$ 个正整数，表示序列的元素。
接下来一行有一个正整数 $q$。
接下来 $q$ 行，每行两个正整数 $l,r$ 表示一个询问。
$q$ 行，每行一个正整数表示答案。
5 1 3 2 3 4 3 2 4 1 3 2 5
2 3 3
Idea：qwaszx，Solution：qwaszx，Code：qwaszx，Data：qwaszx
对于 $20\%$ 的数据，满足 $n,q,a_i\leq 5\times 10^3$。
对于 $50\%$ 的数据，满足 $n,q,a_i\leq 5\times 10^4$。
对于 $100\%$ 的数据，满足 $1\leq n,q\leq 2\times 10^6$，$1\leq a_i\leq n$。
The discussion section is only for posting: Editorials, General Discussions (problem-solving strategies, alternative approaches), and Off-topic conversations.
This is NOT for reporting issues! If you want to report bugs or errors, please use the Issues section below.
If you find any issues with the problem (statement, scoring, time/memory limits, test cases, etc.), you may submit an issue here. A problem moderator will review your issue.
Guidelines: