# [Solution] Eating Candies solution codeforces

Eating Candies solution codeforces – There are 𝑛n candies put from left to right on a table. The candies are numbered from left to right. The 𝑖i-th candy has weight 𝑤𝑖wi. Alice and Bob eat candies.

## [Solution] Eating Candies solution codeforces

Alice can eat any number of candies from the left (she can’t skip candies, she eats them in a row).

Bob can eat any number of candies from the right (he can’t skip candies, he eats them in a row).

Of course, if Alice ate a candy, Bob can’t eat it (and vice versa).

They want to be fair. Their goal is to eat the same total weight of candies. What is the most number of candies they can eat in total?

## [Solution] Eating Candies solution codeforces

The first line contains an integer 𝑡t (1𝑡1041≤t≤104) — the number of test cases.

The first line of each test case contains an integer 𝑛n (1𝑛21051≤n≤2⋅105) — the number of candies on the table.

The second line of each test case contains 𝑛n integers 𝑤1,𝑤2,,𝑤𝑛w1,w2,…,wn (1𝑤𝑖1041≤wi≤104) — the weights of candies from left to right.

It is guaranteed that the sum of 𝑛n over all test cases does not exceed 21052⋅105.

Output

For each test case, print a single integer — the maximum number of candies Alice and Bob can eat in total while satisfying the condition.

## [Solution] Eating Candies solution codeforces

Example
input

Copy
4
3
10 20 10
6
2 1 4 2 4 1
5
1 2 4 8 16
9
7 3 20 5 15 1 11 8 10

output

Copy
2
6
0
7


## Eating Candies solution codeforces

For the first test case, Alice will eat one candy from the left and Bob will eat one candy from the right. There is no better way for them to eat the same total amount of weight. The answer is 22 because they eat two candies in total.

For the second test case, Alice will eat the first three candies from the left (with total weight 77) and Bob will eat the first three candies from the right (with total weight 77). They cannot eat more candies since all the candies have been eaten, so the answer is 66 (because they eat six candies in total).

For the third test case, there is no way Alice and Bob will eat the same non-zero weight so the answer is 00.

For the fourth test case, Alice will eat candies with weights [7,3,20][7,3,20] and Bob will eat candies with weights [10,8,11,1][10,8,11,1], they each eat 3030 weight. There is no better partition so the answer is 77.