Bursting Balloons Problem

Given an array ARR of size N, where each element represents the height of a balloon. The task is to destroy all balloons by shooting arrows from left to right. When an arrow hits a balloon, it continues its path at a height decreased by 1. Determine the minimum number of arrows needed to burst all balloons.

Input:

The first line of input contains an integer N, denoting the size of the array.
The second line of input contains N space-separated integers representing the heights of the balloons.

Output:

Return a single integer, which is the minimum number of arrows required to burst all balloons.

Example:

Input:

N = 5
ARR = [2, 3, 4, 5, 1]

Output:

3

Constraints:

• 1 <= N <= 5*10⁵
• 1 <= ARR[i] <= 10⁹
• Time Limit: 1sec

Note:

You are not required to print the output; it is already managed. Just implement the function.