# Weird Subarrays Codechef Solution

### We Are Discuss About CODECHEF SOLUTION

Weird Subarrays Codechef Solution

## Weird Subarrays Codechef Solution

Answers will be Uploaded Shortly and it will be Notified on Telegram, So JOIN NOW

## Problem

An array A is called weird if it can be sorted by applying the given operation any number of times:

• Select any index i (1 \le i \le |A|) and set A_i := -A_i.

For example: A = [2, 1, 3] is weird since after applying the operation at i = 1A becomes [-2, 1, 3] which is sorted.

JJ has a permutation P of length N. He wants to find the number of subarrays of P which are weird. Can you help him?

### Input Format

• The first line contains a single integer T — the number of test cases. Then the test cases follow.
• The first line of each test case contains an integer N — the size of the permutation P.
• The second line of each test case contains N space-separated integers P_1, P_2, \dots, P_N denoting the permutation P.

### Output Format

For each test case, output on a new line the number of weird subarrays of P.

### Constraints

• 1 \leq T \leq 10^5
• 1 \leq N \leq 10^5
• P is a permutation.
• Sum of N over all test cases does not exceed 2 \cdot 10^5.

### Sample 1:

Input

Output

3
3
2 3 1
3
2 1 3
4
1 2 3 4

5
6
10


### Explanation:

Test Case 1: Weird subarrays of P are: [2], [3], [1], [2, 3], [3, 1].

Test Case 2: Weird subarrays of P are: [2], [1], [3], [2, 1], [1, 3], [2, 1, 3].

Answers will be Uploaded Shortly and it will be Notified on Telegram, So JOIN NOW

## Weird Subarrays Codechef Solution

Yhaa You have done it but next? if YOU Want to Get Others Please Visit Here JOIN NOW

Answers will be Uploaded Shortly and it will be Notified on Telegram, So JOIN NOW