human
Count Strictly Increasing Subarrays | Python3 program to count number of strictly increasing subarrays.
Initialize count of subarrays as 0.
Pick starting point.
Pick ending point.
If subarray arr [ i . . j ] is not strictly increasing , then subarrays after it , i . e . , arr [ i . . j + 1 ] , arr [ i . . j + 2 ] , ... . cannot be strictly increasing.
Driver code"
Solution in Python:
 Can you provide a code to count Strictly Increasing Subarrays and the other steps required?
assistant
#Here is code to count Strictly Increasing Subarrays and the other steps required.
 def countIncreasing ( arr , n ) :
	cnt = 0
	for i in range ( 0 , n ) :
		for j in range ( i + 1 , n ) :
			if arr [ j ] > arr [ j - 1 ] :
				cnt += 1
			else :
				break
	return cnt
arr = [ 1 , 2 , 2 , 4 ]
n = len ( arr )
print ( " Count ▁ of ▁ strictly ▁ increasing ▁ subarrays ▁ is " , countIncreasing ( arr , n ) )