codeforces-scrape

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

1736C1.md (1754B)


      1 Source: https://codeforces.com/problemset/problem/1736/C1
      2 
      3 C1. Good Subarrays (Easy Version)
      4 
      5 time limit per test
      6 
      7 1 second
      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 This is the easy version of this problem. In this version, we do not have queries. Note that we have multiple test cases in this version. You can make hacks only if both versions of the problem are solved.
     22 
     23 An array $b$ of length $m$ is good if for all $i$ the $i$-th element is greater than or equal to $i$. In other words, $b$ is good if and only if $b_i \geq i$ for all $i$ ($1 \leq i \leq m$).
     24 
     25 You are given an array $a$ consisting of $n$ positive integers. Find the number of pairs of indices $(l, r)$, where $1 \le l \le r \le n$, such that the array $[a_l, a_{l+1}, \ldots, a_r]$ is good.
     26 
     27 Input
     28 
     29 Each test contains multiple test cases. The first line contains the number of test cases $t$ ($1 \leq t \leq 2 \cdot 10^5$). Description of the test cases follows.
     30 
     31 The first line of each test case contains an integer $n$ ($1 \leq n \leq 2 \cdot 10^5$), the length of the array $a$.
     32 
     33 The second line of each test case contains $n$ space-separated integers $a_1,a_2,\ldots,a_n$ ($1 \leq a_i \leq n$), representing the array $a$.
     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, print the number of suitable pairs of indices.
     40 
     41 Example
     42 
     43 Input
     44 
     45 ```
     46 3
     47 
     48 3
     49 
     50 1 2 3
     51 
     52 3
     53 
     54 1 1 1
     55 
     56 4
     57 
     58 2 1 4 3
     59 ```
     60 
     61 Output
     62 
     63 ```
     64 6
     65 3
     66 7
     67 ```
     68 
     69 Note
     70 
     71 In the first test case, all subarrays of $a$ are good, so all pairs are suitable.
     72 
     73 In the second test case, the pairs $(1, 1)$, $(2, 2)$, and $(3, 3)$ are suitable. For example, when $(l, r) = (1, 2)$, the array $b=[1,1]$ is not good because $b_2 \lt 2$.