{"problem":{"name":"Maximal Value","description":{"content":"There is an integer sequence $A$ of length $N$ whose values are unknown. Given is an integer sequence $B$ of length $N-1$ which is known to satisfy the following: $B_i \\geq \\max(A_i, A_{i+1})$ Find th","description_type":"Markdown"},"platform":"AtCoder","limit":{"time_limit":2000,"memory_limit":262144},"difficulty":"None","is_remote":true,"is_sync":true,"sync_url":null,"sign":"abc140_c"},"statements":[{"statement_type":"Markdown","content":"There is an integer sequence $A$ of length $N$ whose values are unknown.\nGiven is an integer sequence $B$ of length $N-1$ which is known to satisfy the following:\n$B_i \\geq \\max(A_i, A_{i+1})$\nFind the maximum possible sum of the elements of $A$.\n\n## Constraints\n\n*   All values in input are integers.\n*   $2 \\leq N \\leq 100$\n*   $0 \\leq B_i \\leq 10^5$\n\n## Input\n\nInput is given from Standard Input in the following format:\n\n$N$\n$B_1$ $B_2$ $...$ $B_{N-1}$\n\n[samples]","is_translate":false,"language":"English"}],"meta":{"iden":"abc140_c","tags":[],"sample_group":[["3\n2 5","9\n\n$A$ can be, for example, ( $2$ , $1$ , $5$ ), ( $-1$ , $-2$ , $-3$ ), or ( $2$ , $2$ , $5$ ). Among those candidates, $A$ = ( $2$ , $2$ , $5$ ) has the maximum possible sum."],["2\n3","6"],["6\n0 153 10 10 23","53"]],"created_at":"2026-03-03 11:01:14"}}