Count Subarrays such that minimum of the end is greater than the maximum of all numbers in between

Правка en2, от Venkatesh2112001, 2025-07-08 19:22:37

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. Язык Кто Когда Δ Комментарий
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)