CF1270B.Interesting Subarray

For an array $a$ of integers let's denote its maximal element as $\max(a)$, and minimal as $\min(a)$. We will call an array $a$ of $k$ integers interesting if $\max(a) - \min(a) \ge k$. For example, array $[1, 3, 4, 3]$ isn't interesting as $\max(a) - \min(a) = 4 - 1 = 3 \lt 4$ while array $[7, 3, 0, 4, 3]$ is as $\max(a) - \min(a) = 7 - 0 = 7 \ge 5$.

You are given an array $a$ of $n$ integers. Find some interesting nonempty subarray of $a$, or tell that it doesn't exist.

An array $b$ is a subarray of an array $a$ if $b$ can be obtained from $a$ by deletion of several (possibly, zero or all) elements from the beginning and several (possibly, zero or all) elements from the end. In particular, an array is a subarray of itself.

对于一个整数数组 $a$，我们用 $\max(a)$ 表示其最大值，$\min(a)$ 表示其最小值。若一个包含 $k$ 个整数的数组 $a$ 满足 $\max(a) - \min(a) \ge k$，则称该数组为有趣的。例如，数组 $[1, 3, 4, 3]$ 不是有趣的，因为 $\max(a) - \min(a) = 4 - 1 = 3 \lt 4$；而数组 $[7, 3, 0, 4, 3]$ 是有趣的，因为 $\max(a) - \min(a) = 7 - 0 = 7 \ge 5$。

给定一个长度为 $n$ 的整数数组 $a$，请找出 $a$ 的一个非空有趣子数组；若不存在，则说明不存在。

数组 $b$ 是数组 $a$ 的一个子数组，当且仅当 $b$ 可通过从 $a$ 的开头删除若干（可能为零或全部）元素、并从 $a$ 的末尾删除若干（可能为零或全部）元素得到。特别地，一个数组是其自身的子数组。

The first line contains integer number $t$ ($1 \le t \le 10\,000$). Then $t$ test cases follow.

The first line of each test case contains a single integer $n$ ($2\le n \le 2\cdot 10^5$) — the length of the array.

The second line of each test case contains $n$ integers $a_1, a_2, \dots, a_n$ ($0\le a_i \le 10^9$) — the elements of the array.

It is guaranteed that the sum of $n$ over all test cases does not exceed $2 \cdot 10^5$.

第一行包含一个整数 $t$（$1 \le t \le 10\,000$）。随后是 $t$ 组测试数据。

每组测试数据的第一行包含一个整数 $n$（$2\le n \le 2\cdot 10^5$）—— 数组的长度。

每组测试数据的第二行包含 $n$ 个整数 $a_1, a_2, \dots, a_n$（$0\le a_i \le 10^9$）—— 数组的元素。

保证所有测试数据的 $n$ 之和不超过 $2 \cdot 10^5$。

For each test case, output "NO" in a separate line if there is no interesting nonempty subarray in $a$.

Otherwise, output "YES" in a separate line. In the next line, output two integers $l$ and $r$ ($1\le l \le r \le n$) — bounds of the chosen subarray. If there are multiple answers, print any.

You can print each letter in any case (upper or lower).

对于每个测试用例，如果数组 $a$ 中不存在有趣的非空子数组，则在单独一行中输出 "NO"。

否则，在单独一行中输出 "YES"；在下一行中输出两个整数 $l$ 和 $r$（$1\le l \le r \le n$），表示所选子数组的边界。若存在多个答案，输出任意一个即可。

你可以以任意大小写（大写或小写）输出每个字母。

In the second test case of the example, one of the interesting subarrays is $a = [2, 0, 1, 9]$: $\max(a) - \min(a) = 9 - 0 = 9 \ge 4$.

在示例的第二个测试用例中，一个有趣的子数组是 $a = [2, 0, 1, 9]$：$\max(a) - \min(a) = 9 - 0 = 9 \ge 4$。