

Play GameTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65535/65535 K (Java/Others)Total Submission(s): 2522 Accepted Submission(s): 1475 Problem Description Alice and Bob are playing a game. There are two piles of cards. There are N cards in each pile, and each card has a score. They take turns to pick up the top or bottom card from either pile, and the score of the card will be added to his total score. Alice and Bob are both clever enough, and will pick up cards to get as many scores as possible. Do you know how many scores can Alice get if he picks up first? Input The first line contains an integer T (T≤100), indicating the number of cases. Each case contains 3 lines. The first line is the N (N≤20). The second line contains N integer a_{i} (1≤a_{i}≤10000). The third line contains N integer b_{i} (1≤b_{i}≤10000). Output For each case, output an integer, indicating the most score Alice can get. Sample Input
Sample Output
Source  
