Locked Safe

Chef has met up with his old friend Jack recently. Jack told Chef that he found a recipe for an ancient dish, but unfortunately, it is locked in a safe and to open the safe, it is necessary to enter the solution to the following problem. There is a sequence of non-negative integers $A_1, A_2, \ldots, A_N$ on the safe. Find the number of pairs $(l, r)$ ($1 \leq l \leq r \leq N$) which satisfy th