Heaps I and i+1 are adjoining for all 1≤i≤n−1. In the event that heap I becomes unfilled, heaps i−1 and i+1 doesn't become adjoining. Alice is too apathetic to even consider eliminating these stones, so she requested that you take this obligation. She permitted you to do just the accompanying activity: Select two adjoining heaps and, if the two of them are not vacant,
Correct answer will be upvoted else downvoted. Computer science.
Heaps I and i+1 are adjoining for all 1≤i≤n−1. In the event that heap I becomes unfilled, heaps i−1 and i+1 doesn't become adjoining.
Alice is too apathetic to even consider eliminating these stones, so she requested that you take this obligation. She permitted you to do just the accompanying activity:
Select two adjoining heaps and, if the two of them are not vacant, eliminate one stone from every one of them.
Alice comprehends that occasionally it's difficult to eliminate all stones with the given activity, so she permitted you to utilize the accompanying superability:
Prior to the beginning of cleaning, you can choose two adjoining heaps and trade them.
Decide, in case it is feasible to eliminate all stones utilizing the superability not more than once.
Input
The main line contains a solitary integer t (1≤t≤104) — the number of experiments.
The principal line of each experiment contains the single integer n (2≤n≤2⋅105) — the number of heaps.
The second line of each experiment contains n integers a1,a2,… ,an (1≤
It is ensured that the complete amount of n over all experiments doesn't surpass 2⋅105.
Output
For each experiment, print YES or NO — is it conceivable to eliminate all stones utilizing the superability not more than once or not.
Step by step
Solved in 4 steps with 1 images
