← 返回题目

题库练习 The Number of Products

← 上一题下一题 →

A12965 | $The Number of Products$

时间限制1s

内存限制256MB

通过 / 提交0/0

题目描述

You are given a sequence $a_1, a_2, \dots, a_n$ consisting of $n$ non-zero integers (i.e. $a_i \ne 0$ ). You have to calculate two following values: 1. the number of pairs of indices $(l, r)$ $(l \le r)$ such that $a_l \cdot a_{l + 1} \dots a_{r - 1} \cdot a_r$ is negative; 2. the number of pairs of indices $(l, r)$ $(l \le r)$ such that $a_l \cdot a_{l + 1} \dots a_{r - 1} \cdot a_r$ is positive;

输入格式

The first line contains one integer $n$ $(1 \le n \le 2 \cdot 10^{5})$ — the number of elements in the sequence. The second line contains $n$ integers $a_1, a_2, \dots, a_n$ $(-10^{9} \le a_i \le 10^{9}; a_i \neq 0)$ — the elements of the sequence.

输出格式

Print two integers — the number of subsegments with negative product and the number of subsegments with positive product, respectively.

输入输出样例

输入 #1

5
5 -3 3 -1 1

输出 #1

8 7

输入 #2

10
4 2 -4 3 1 2 -4 3 2 3

输出 #2

28 27

输入 #3

5
-1 -2 -3 -4 -5

输出 #3

9 6

C++ 编辑器

输入

输出