C={c1,c2,… ,cm} (c1
Correct answer will be upvoted else downvoted.
Let C={c1,c2,… ,cm} (c1<c2<… <cm) be the arrangement of individuals who hold cardboards of 'C'. Let P={p1,p2,… ,pk} (p1<p2<… <pk) be the arrangement of individuals who hold cardboards of 'P'. The photograph is acceptable if and provided that it fulfills the accompanying requirements:
C∪P={1,2,… ,n}
C∩P=∅.
ci−ci−1≤ci+1−ci(1<i<m).
pi−pi−1≥pi+1−pi(1<i<k).
Given a cluster a1,… ,an, kindly track down the number of good photographs fulfilling the accompanying condition:
∑x∈Cax<∑y∈Pay.
The appropriate response can be huge, so output it modulo 998244353. Two photographs are unique if and provided that there exists no less than one individual who holds a cardboard of 'C' in one photograph yet holds a cardboard of 'P' in the other.
Input
Each test contains numerous experiments. The main line contains the number of experiments t (1≤t≤200000). Depiction of the experiments follows.
The principal line of each experiment contains a solitary integer n (1≤n≤200000).
The subsequent line contains n integers a1,a2,… ,an (1≤
It is ensured that the amount of n over all experiments doesn't surpass 200000.
Output
For each experiment, output the appropriate response modulo 998244353 in a different line.
Step by step
Solved in 3 steps with 1 images
