2535. Count Strictly Increasing Subarrays

Medium
Array
Math
Dynamic Programming

Description

Hints

Hint 1
Find the number of strictly increasing subarrays that end at a specific index. Can you calculate that for each index from 0 to n - 1?
Hint 2
The answer will be the sum of the number of subarrays that end at each index.

Statistics

Acceptance
71.2%
Submissions
11,291
Accepted
8,044