codeforces-scrape

Codeforces scraped problems and editorials
git clone git://git.laack.co/codeforces-scrape.git
Log | Files | Refs | README

1270B.md (1987B)


      1 Source: https://codeforces.com/problemset/problem/1270/B
      2 
      3 B. Interesting Subarray
      4 
      5 time limit per test
      6 
      7 2 seconds
      8 
      9 memory limit per test
     10 
     11 256 megabytes
     12 
     13 input
     14 
     15 standard input
     16 
     17 output
     18 
     19 standard output
     20 
     21 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$.
     22 
     23 You are given an array $a$ of $n$ integers. Find some interesting nonempty subarray of $a$, or tell that it doesn't exist.
     24 
     25 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.
     26 
     27 Input
     28 
     29 The first line contains integer number $t$ ($1 \le t \le 10\,000$). Then $t$ test cases follow.
     30 
     31 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.
     32 
     33 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.
     34 
     35 It is guaranteed that the sum of $n$ over all test cases does not exceed $2 \cdot 10^5$.
     36 
     37 Output
     38 
     39 For each test case, output "NO" in a separate line if there is no interesting nonempty subarray in $a$.
     40 
     41 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.
     42 
     43 You can print each letter in any case (upper or lower).
     44 
     45 Example
     46 
     47 Input
     48 
     49 ```
     50 3
     51 5
     52 1 2 3 4 5
     53 4
     54 2 0 1 9
     55 2
     56 2019 2020
     57 ```
     58 
     59 Output
     60 
     61 ```
     62 NO
     63 YES
     64 1 4
     65 NO
     66 ```
     67 
     68 Note
     69 
     70 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$.