CF1380A.Three Indices

普及/提高-

通过率：0%

AC君温馨提醒

该题目为【codeforces】题库的题目，您提交的代码将被提交至codeforces进行远程评测，并由ACGO抓取测评结果后进行展示。由于远程测评的测评机由其他平台提供，我们无法保证该服务的稳定性，若提交后无反应，请等待一段时间后再进行重试。

题目描述

You are given a permutation $p_1, p_2, \dots, p_n$ . Recall that sequence of $n$ integers is called a permutation if it contains all integers from $1$ to $n$ exactly once.

Find three indices $i$ , $j$ and $k$ such that:

$1 \le i < j < k \le n$ ;
$p_i < p_j$ and $p_j > p_k$ .

Or say that there are no such indices.

输入格式

The first line contains a single integer $T$ ( $1 \le T \le 200$ ) — the number of test cases.

Next $2T$ lines contain test cases — two lines per test case. The first line of each test case contains the single integer $n$ ( $3 \le n \le 1000$ ) — the length of the permutation $p$ .

The second line contains $n$ integers $p_1, p_2, \dots, p_n$ ( $1 \le p_i \le n$ ; $p_i \neq p_j$ if $i \neq j$ ) — the permutation $p$ .

输出格式

For each test case:

if there are such indices $i$ , $j$ and $k$ , print YES (case insensitive) and the indices themselves;
if there are no such indices, print NO (case insensitive).

If there are multiple valid triples of indices, print any of them.

输入输出样例

输入#1

3
4
2 1 4 3
6
4 6 1 2 5 3
5
5 3 1 2 4

输出#1

YES
2 3 4
YES
3 5 6
NO

首页