Correct answer will be upvoted else Multiple Downvoted. Computer science. Polycarp chooses the list I and adds the worth man-made intelligence to one of his selection of its neighbors. All the more officially, Polycarp adds the worth of artificial intelligence to ai−1 or to ai+1 (assuming such a neighbor doesn't exist, it is difficult to add to it). Subsequent to adding it, Polycarp eliminates the I-th component from the an exhibit. During this progression the length of an is diminished by 1. The two things above together mean one single activity. For instance, on the off chance that Polycarp has an exhibit a=[3,1,6,6,2], it can play out the accompanying succession of activities with it: Polycarp chooses i=2 and adds the worth artificial intelligence to (i−1)- th component: a=[4,6,6,2]. Polycarp chooses i=1 and adds the worth artificial intelligence to (i+1)- th component: a=[10,6,2]. Polycarp chooses i=3 and adds the worth artificial intelligence to (i−1)- th component: a=[10,8]. Polycarp chooses i=2 and adds the worth artificial intelligence to (i−1)- th component: a=[18]. Note that Polycarp could quit performing activities whenever. Polycarp considered the number of least tasks he would have to perform to make every one of the components of an equivalent (i.e., he needs all artificial intelligence are equivalent to one another). Input The primary line contains a solitary integer t (1≤t≤3000) — the number of experiments in the test. Then, at that point, t experiments follow. The primary line of each experiment contains a solitary integer n (1≤n≤3000) — the length of the exhibit. The following line contains n integers a1,a2,… ,an (1≤ai≤105) — cluster a. It is ensured that the amount of n over all experiments doesn't surpass 3000. Output For each experiment, output a solitary number — the base number of tasks that Polycarp needs to perform so all components of the an exhibit are something very similar (equivalent).
Correct answer will be upvoted else Multiple Downvoted. Computer science.
Polycarp chooses the list I and adds the worth man-made intelligence to one of his selection of its neighbors. All the more officially, Polycarp adds the worth of
Subsequent to adding it, Polycarp eliminates the I-th component from the an exhibit. During this progression the length of an is diminished by 1.
The two things above together mean one single activity.
For instance, on the off chance that Polycarp has an exhibit a=[3,1,6,6,2], it can play out the accompanying succession of activities with it:
Polycarp chooses i=2 and adds the worth artificial intelligence to (i−1)- th component: a=[4,6,6,2].
Polycarp chooses i=1 and adds the worth artificial intelligence to (i+1)- th component: a=[10,6,2].
Polycarp chooses i=3 and adds the worth artificial intelligence to (i−1)- th component: a=[10,8].
Polycarp chooses i=2 and adds the worth artificial intelligence to (i−1)- th component: a=[18].
Note that Polycarp could quit performing activities whenever.
Polycarp considered the number of least tasks he would have to perform to make every one of the components of an equivalent (i.e., he needs all artificial intelligence are equivalent to one another).
Input
The primary line contains a solitary integer t (1≤t≤3000) — the number of experiments in the test. Then, at that point, t experiments follow.
The primary line of each experiment contains a solitary integer n (1≤n≤3000) — the length of the exhibit. The following line contains n integers a1,a2,… ,an (1≤ai≤105) — cluster a.
It is ensured that the amount of n over all experiments doesn't surpass 3000.
Output
For each experiment, output a solitary number — the base number of tasks that Polycarp needs to perform so all components of the an exhibit are something very similar (equivalent).
Step by step
Solved in 4 steps with 1 images
