Dormi got a histogram with n bars of stature a1,a2,… ,a for Christmas. Notwithstanding, the more he played with his new histogram, the more he understood its flaws, so today he needed to change it however he would prefer. To change the histogram, Little Dormi can play out the accompanying activity a subjective number of times: Select a record I (1≤i≤n)
Correct answer will be upvoted else downvoted.
Little Dormi got a histogram with n bars of stature a1,a2,… ,a for Christmas. Notwithstanding, the more he played with his new histogram, the more he understood its flaws, so today he needed to change it however he would prefer.
To change the histogram, Little Dormi can play out the accompanying activity a subjective number of times:
Select a record I (1≤i≤n) where
Little Dormi characterizes the offensiveness score of his histogram (subsequent to playing out some number of tasks) as the amount of the upward length of its framework and the number of activities he performed on it. Furthermore, to make the histogram as wonderful as could really be expected, he might want to limit the grotesqueness score subsequent to adjusting it with some number of activities.
Nonetheless, as his histogram is extremely huge, Little Dormi is experiencing difficulty limiting the grotesqueness score, so as Little Dormi's more seasoned sibling, assist him with tracking down the insignificant offensiveness.
Input :Each test contains different experiments. The primary line contains the number of experiments t (1≤t≤104). Portrayal of the experiments follows.
The primary line of each experiment contains a solitary integer n (1≤n≤4⋅105).
The second line of each experiment contains n integers a1,a2,… ,an (0≤ai≤109).
It is ensured that the amount of n over all experiments doesn't surpass 4⋅105.
Output :For each experiment output one integer, the negligible grotesqueness Little Dormi can accomplish with the histogram in that experiment.
Step by step
Solved in 3 steps with 1 images
