How to counts the number of ascending arrays in one-dimensional array ? (Sorry my bad english)

Question

n=8
Input: 6 4 6 3 12 18 9 11
Output: 6
4 6 (1)
3 12 18 (2)
9 11 (3)
Asending array is: 3
https://code.sololearn.com/cHdJCNi9kpxU/?ref=app

Answer 1

:(, how to fix this and how to counts the number of ascending arrays, thank you

Answer 2

Thanks, I think my code reads from a[0] to a[7], with n = 8 {0,1..7}