He first calculated the number of prefixes whose product is positive pos or negative neg. Then to get all negative sub-arrays whose product is negative the answer will be pos * neg. All sub-arrays count is n * (n + 1) / 2 so we subtract the number of negatives to get the positives.

You may have heard of prefix sum.

Consider two positive integers $$$l_1$$$ and $$$l_2$$$ and a function $$$f(x) = a_{1} * a_{2} * .. * a_{x}$$$. Let $$$f(l_{1})$$$ be $$$-ve$$$ and $$$f(l_{2})$$$ be $$$+ve$$$. Now, if $$$l_{1} > l_{2}$$$, it's easy to see that product of segment $$$a_{l_{2}+1} .. a_{l_{1}}$$$ is $$$-ve$$$ and if $$$l_{2} > l_{1}$$$ then product of segment $$$a_{l_{1}+1} .. a_{l_{2}}$$$ is negative. So the number of negative segments is the product of a number of prefixes with $$$+ve$$$ product and the number of prefixes with $$$-ve$$$ product.

Someone can.

It's basically a prefix sums problem.

The product is negative if and only if there is an odd number of negative multipliers (since we don't have zeroes). So if we say that the positive number is 0 and the negative is 1, we are asked to calculate the number of segments with odd/even sum. The sum on a segment is the difference of prefix sums in borders. So the sum on a segment is odd if and only if the difference of prefix sums is odd, which will be true if and only if the parity of prefix sums is different. So we need to choose one border with an even sum and one border with an odd sum. The number of ways to do it is the number of borders with an even sum times the number of borders with an odd sum.