{"problem":{"name":"Candies","description":{"content":"We have a $2 \\times N$ grid. We will denote the square at the $i$\\-th row and $j$\\-th column ($1 \\leq i \\leq 2$, $1 \\leq j \\leq N$) as $(i, j)$. You are initially in the top-left square, $(1, 1)$. You","description_type":"Markdown"},"platform":"AtCoder","limit":{"time_limit":2000,"memory_limit":262144},"difficulty":"None","is_remote":true,"is_sync":true,"sync_url":null,"sign":"arc090_a"},"statements":[{"statement_type":"Markdown","content":"We have a $2 \\times N$ grid. We will denote the square at the $i$\\-th row and $j$\\-th column ($1 \\leq i \\leq 2$, $1 \\leq j \\leq N$) as $(i, j)$.\nYou are initially in the top-left square, $(1, 1)$. You will travel to the bottom-right square, $(2, N)$, by repeatedly moving right or down.\nThe square $(i, j)$ contains $A_{i, j}$ candies. You will collect all the candies you visit during the travel. The top-left and bottom-right squares also contain candies, and you will also collect them.\nAt most how many candies can you collect when you choose the best way to travel?\n\n## Constraints\n\n*   $1 \\leq N \\leq 100$\n*   $1 \\leq A_{i, j} \\leq 100$ ($1 \\leq i \\leq 2$, $1 \\leq j \\leq N$)\n\n## Input\n\nInput is given from Standard Input in the following format:\n\n$N$\n$A_{1, 1}$ $A_{1, 2}$ $...$ $A_{1, N}$\n$A_{2, 1}$ $A_{2, 2}$ $...$ $A_{2, N}$\n\n[samples]","is_translate":false,"language":"English"}],"meta":{"iden":"arc090_a","tags":[],"sample_group":[["5\n3 2 2 4 1\n1 2 2 2 1","14\n\nThe number of collected candies will be maximized when you:\n\n*   move right three times, then move down once, then move right once."],["4\n1 1 1 1\n1 1 1 1","5\n\nYou will always collect the same number of candies, regardless of how you travel."],["7\n3 3 4 5 4 5 3\n5 3 4 4 2 3 2","29"],["1\n2\n3","5"]],"created_at":"2026-03-03 11:01:13"}}