You're given a cluster b of length n. How about we characterize another cluster a, likewise of length n, for which ai=2bi (1≤i≤n). Valerii says that each two non-meeting subarrays of a have various amounts of components. You need to decide whether he isn't right. All the more officially, you want to decide whether there exist four integers l1,r1,l2,r2 that fulfill the
Correct answer will be upvoted else Multiple Downvoted. Don't submit random answer. Computer science.
You're given a cluster b of length n. How about we characterize another cluster a, likewise of length n, for which
Valerii says that each two non-meeting subarrays of a have various amounts of components. You need to decide whether he isn't right. All the more officially, you want to decide whether there exist four integers l1,r1,l2,r2 that fulfill the accompanying conditions:
1≤l1≤r1<l2≤r2≤n;
al1+al1+1+… +ar1−1+ar1=al2+al2+1+… +ar2−1+ar2.
If such four integers exist, you will discredit Valerii. Do they exist?
An exhibit c is a subarray of a cluster d if c can be acquired from d by erasure of a few (potentially, zero or all) components from the start and a few (conceivably, zero or all) components from the end.
Input
Each test contains various experiments. The main line contains the number of experiments t (1≤t≤100). Depiction of the experiments follows.
The main line of each experiment contains a solitary integer n (2≤n≤1000).
The second line of each experiment contains n integers b1,b2,… ,bn (0≤bi≤109).
Output
For each experiment, if there exist two non-meeting subarrays in a that have a similar total, output YES on a different line. In any case, output NO on a different line.
Additionally, note that each letter can be regardless
Step by step
Solved in 4 steps with 1 images
