Subarrays with length

You are given an array $A$ of length $N$. Determine the count of subarrays of $A$ which contain their length as an element. Formally, count the number of pairs $(L, R)$ $(1\le L\le R\le N)$ such that: $(R-L+1) \in \{A_L, A_{L+1}, \ldots, A_R\}$. ### Input - First line will contain $T$, number of test cases. Then the test cases follow. - First line of each test case contains an integer $N$ denot