| # | User | Rating |
|---|---|---|
| 1 | tourist | 4009 |
| 2 | jiangly | 3823 |
| 3 | Benq | 3738 |
| 4 | Radewoosh | 3633 |
| 5 | jqdai0815 | 3620 |
| 6 | orzdevinwang | 3529 |
| 7 | ecnerwala | 3446 |
| 8 | Um_nik | 3396 |
| 9 | ksun48 | 3390 |
| 10 | gamegame | 3386 |
| # | User | Contrib. |
|---|---|---|
| 1 | cry | 167 |
| 2 | Um_nik | 163 |
| 3 | maomao90 | 162 |
| 3 | atcoder_official | 162 |
| 5 | adamant | 159 |
| 6 | -is-this-fft- | 158 |
| 7 | awoo | 157 |
| 8 | TheScrasse | 154 |
| 9 | Dominater069 | 153 |
| 9 | nor | 153 |
Special Subarray
You are given an array arr of size N of non negative integers. Find number of subarrays of array which are special. A subarray is special if product of its maximum and minimum element in divisible by length of the subarray.
Find Number of special Subarrays.
1 <= no of test cases <= 1000
1 <= N < 5*10^4
0 <= arr[i] <= 30
Can anyone tell me approach for this problem?
| Rev. | Lang. | By | When | Δ | Comment | |
|---|---|---|---|---|---|---|
| en4 |
|
TalentnotDefined | 2023-07-13 21:38:49 | 4 | Tiny change: ' <= 1000\n1 <= N < 5*10^4\n0 <= arr' -> ' <= 1000\n\n1 <= N < 5*10^4\n\n0 <= arr' | |
| en3 |
|
TalentnotDefined | 2023-07-13 21:38:35 | 36 | Constraint Updated | |
| en2 |
|
TalentnotDefined | 2023-07-13 20:16:33 | 2 | Tiny change: ' <= 10^5\n0 <= arr' -> ' <= 10^5\n\n0 <= arr' | |
| en1 |
|
TalentnotDefined | 2023-07-13 20:12:59 | 363 | Initial revision (published) |
