You can utilize the accompanying activity however many occasions as you like: select any integer 1≤k≤n and do one of two things: decrement by one k of the principal components of the cluster. decrement by one k of the last components of the exhibit. For instance, on the off chance that n=5 and a=[3,2,2,1,4],
Correct answer will be upvoted else Multiple Downvoted. Don't submit random answer. Computer science.
You can utilize the accompanying activity however many occasions as you like: select any integer 1≤k≤n and do one of two things:
decrement by one k of the principal components of the cluster.
decrement by one k of the last components of the exhibit.
For instance, on the off chance that n=5 and a=[3,2,2,1,4], you can apply one of the accompanying activities to it (not all potential choices are recorded beneath):
decrement from the initial two components of the exhibit. After this activity a=[2,1,2,1,4];
decrement from the last three components of the exhibit. After this activity a=[3,2,1,0,3];
decrement from the initial five components of the cluster. After this activity a=[2,1,1,0,3];
Decide whether it is feasible to make every one of the components of the cluster equivalent to zero by applying a specific number of tasks.
Input
The main line contains one sure integer t (1≤t≤30000) — the number of experiments. Then, at that point, t experiments follow.
Each experiment starts with a line containing one integer n (1≤n≤30000) — the number of components in the exhibit.
The second line of each experiment contains n integers a1… an (1≤
The amount of n over all experiments doesn't surpass 30000.
Output
For each experiment, output on a different line:
Indeed, in case it is feasible to make all components of the exhibit equivalent to zero by applying a specific number of activities.
NO, in any case.
The letters in the words YES and NO can be outputed regardless.
Step by step
Solved in 4 steps with 1 images
