Count Subarrays such that minimum of the end is greater than the maximum of all numbers in between
For a given array A of size n, find the count of subarrays of size>3, where the minimum of the elements at both the ends of subarray is greater than the maximum of all the numbers in between.
Formally, if the subarray starts at l and ends at r, then min(A[l], A[r]) > max(A[l+1], A[l+2],..., A[r-1]).
0<= n <=1e5 1<= A[i] <=1e9
| Rev. | Lang. | By | When | Δ | Comment | |
|---|---|---|---|---|---|---|
| en2 |
|
Venkatesh2112001 | 2025-07-08 19:22:37 | 1 | Tiny change: 's of size>3, where t' -> 's of size>=3, where t' | |
| en1 |
|
Venkatesh2112001 | 2025-07-08 15:42:11 | 436 | Initial revision (published) |
| # | User | Rating |
|---|---|---|
| 1 | Benq | 3792 |
| 2 | VivaciousAubergine | 3647 |
| 3 | Kevin114514 | 3603 |
| 4 | jiangly | 3583 |
| 5 | strapple | 3515 |
| 6 | tourist | 3470 |
| 7 | dXqwq | 3436 |
| 8 | Radewoosh | 3415 |
| 9 | Otomachi_Una | 3413 |
| 10 | Um_nik | 3376 |
| # | User | Contrib. |
|---|---|---|
| 1 | Qingyu | 157 |
| 2 | adamant | 153 |
| 3 | Um_nik | 146 |
| 3 | Proof_by_QED | 146 |
| 5 | Dominater069 | 145 |
| 6 | errorgorn | 141 |
| 7 | cry | 139 |
| 8 | YuukiS | 135 |
| 9 | TheScrasse | 134 |
| 10 | chromate00 | 133 |
