B"Entering senior high school life, Tom is attracted by LIS problems, not only the Longest Increasing Subsequence problem, but also the Largest Interval Sum problem. Now he gets a really interesting problem from his friend Daniel. However, it seems too hard for him to solve it, so he asks you for help. Given an array a consisting of n integers. In one operation, you do the following: Find the minimum number of operations you need to perform to make a_i<0 for every 1 <= i <= n . The first line of input contains a single integer n ( 1 <= n <= 5 cdot 10^5 ) -- the length of the array a . The second line contains n integers a_1,a_2, ldots,a_n ( -10^6 <= a_i <= 10^6 ) -- the elements of the array a . Print a single integer -- the minimum number of operations. In the first example, you can do operations on intervals [1,5],[1,5],[2,5],[3,5],[4,5],[5,5] in such order. You may also do operations on intervals [1,5],[2,5],[3,5],[4,5],[5,5],[1,5] in such order. In the second example, it's already satisfied that a_i<0 for every 1 <= i <= n . So you do not need to perform any operations. "...