Help me with this Ques

Revision en3, by AbhinavBisht, 2022-09-09 20:32:36

Given an array We need to find the count of all the elements in all the subarrays which are neither min nor max in that particular subarray

eg

4
30 47 19 23
ans = 4
i.e in 30 47 19 count is 1 --> 30 is netiher max nor min
    in 30 47 19 23 count is 2 --> 30 and 23 
    int 47 19 23 count is 1 --> 23 
3
11 20 17
ans = 1
We can have duplicate elements as input 

n = 10^5 // size of array

History

 
 
 
 
Revisions
 
 
  Rev. Lang. By When Δ Comment
en3 English AbhinavBisht 2022-09-09 20:32:36 91
en2 English AbhinavBisht 2022-09-09 20:29:43 46
en1 English AbhinavBisht 2022-09-09 20:26:58 364 Initial revision (published)