def solve():
n = int(input())
numbers = input().split()
i = 0
while i < n:
numbers[i] = int(numbers[i])
i += 1
prefix_min_idx = [0] * n
i = 1
while i < n:
t = prefix_min_idx[i - 1]
if numbers[i] < numbers[t]:
prefix_min_idx[i] = i
else:
prefix_min_idx[i] = t
i += 1
suffix_min_idx = [0] * n
suffix_min_idx[n - 1] = n - 1
i = n - 2
while i >= 0:
t = suffix_min_idx[i + 1]
if numbers[i] < numbers[t]:
suffix_min_idx[i] = i
else:
suffix_min_idx[i] = t
i -= 1
j = 1
found = False
while j < n - 1:
i = prefix_min_idx[j - 1]
k = suffix_min_idx[j + 1]
if numbers[i] < numbers[j] and numbers[k] < numbers[j]:
print("YES")
print(i + 1, j + 1, k + 1, sep=" ")
found = True
break
j += 1
if found == False:
print("NO")
t = int(input())
while t != 0:
solve()
t -= 1#include<iostream>
using namespace std;
int main()
{
int t;
cin >> t;
while(t--){
int n;
cin >> n;
int a[n];
for (int i = 0; i < n; i++){
cin >> a[i];
}
bool b = false;
for (int i = 1; i < n-1; i++){
if(a[i] > a[i+1] && a[i] > a[i-1] && b == false){
cout << "YES" << endl;
cout << i << " " << i+1 << " " << i+2 << endl;
b = true;
}
}
if(b == false) cout <<"NO" << endl;;
}
return 0;
}1356. Sort Integers by The Number of 1 Bits | 922. Sort Array By Parity II |
344. Reverse String | 1047. Remove All Adjacent Duplicates In String |
977. Squares of a Sorted Array | 852. Peak Index in a Mountain Array |
461. Hamming Distance | 1748. Sum of Unique Elements |
897. Increasing Order Search Tree | 905. Sort Array By Parity |
1351. Count Negative Numbers in a Sorted Matrix | 617. Merge Two Binary Trees |
1450. Number of Students Doing Homework at a Given Time | 700. Search in a Binary Search Tree |
590. N-ary Tree Postorder Traversal | 589. N-ary Tree Preorder Traversal |
1299. Replace Elements with Greatest Element on Right Side | 1768. Merge Strings Alternately |
561. Array Partition I | 1374. Generate a String With Characters That Have Odd Counts |
1822. Sign of the Product of an Array | 1464. Maximum Product of Two Elements in an Array |
1323. Maximum 69 Number | 832. Flipping an Image |
1295. Find Numbers with Even Number of Digits | 1704. Determine if String Halves Are Alike |
1732. Find the Highest Altitude | 709. To Lower Case |
1688. Count of Matches in Tournament | 1684. Count the Number of Consistent Strings |