No of Increasing and decreasing sub-arrays in an array

I recently came across a new problem which tells to find whether the number of increasing sub-arrays in the array and no of decreasing sub-arrays in the array are equal or not in O(1) time.
How can we proceed?