painting the components, he has composed two successions r1,r2,… ,rn and b1,b2,… ,bm. The succession r comprised of all red components of an as per the pattern in which they showed up in a; correspondingly, the arrangement b comprised of all blue components of an according to the pattern in which they showed up in an also.
Correct answer will be upvoted else Multiple Downvoted. Computer science.
painting the components, he has composed two successions r1,r2,… ,rn and b1,b2,… ,bm. The succession r comprised of all red components of an as per the pattern in which they showed up in a; correspondingly, the arrangement b comprised of all blue components of an according to the pattern in which they showed up in an also.
Lamentably, the first grouping was lost, and Monocarp just has the successions r and b. He needs to reestablish the first succession. On the off chance that there are various ways of reestablishing it, he needs to pick a way of reestablishing that amplifies the worth of
f(a)=max(0,a1,(a1+a2),(a1+a2+a3),… ,(a1+a2+a3+⋯+an+m))
Assist Monocarp with working out the greatest conceivable worth of f(a).
Input
The main line contains one integer t (1≤t≤1000) — the number of experiments. Then, at that point, the experiments follow. Each experiment comprises of four lines.
The principal line of each experiment contains one integer n (1≤n≤100).
The subsequent line contains n integers r1,r2,… ,rn (−100≤ri≤100).
The third line contains one integer m (1≤m≤100).
The fourth line contains m integers b1,b2,… ,bm (−100≤bi≤100).
Output
For each experiment, print one integer — the most extreme conceivable worth of f(a).
Step by step
Solved in 4 steps with 1 images
