{"problem":{"name":"Boxes and Candies","description":{"content":"There are $N$ boxes arranged in a row. Initially, the $i$\\-th box from the left contains $a_i$ candies. Snuke can perform the following operation any number of times: *   Choose a box containing at l","description_type":"Markdown"},"platform":"AtCoder","limit":{"time_limit":2000,"memory_limit":262144},"difficulty":"None","is_remote":true,"is_sync":true,"sync_url":null,"sign":"arc064_a"},"statements":[{"statement_type":"Markdown","content":"There are $N$ boxes arranged in a row. Initially, the $i$\\-th box from the left contains $a_i$ candies.\nSnuke can perform the following operation any number of times:\n\n*   Choose a box containing at least one candy, and eat one of the candies in the chosen box.\n\nHis objective is as follows:\n\n*   Any two neighboring boxes contain at most $x$ candies in total.\n\nFind the minimum number of operations required to achieve the objective.\n\n## Constraints\n\n*   $2 ≤ N ≤ 10^5$\n*   $0 ≤ a_i ≤ 10^9$\n*   $0 ≤ x ≤ 10^9$\n\n## Input\n\nThe input is given from Standard Input in the following format:\n\n$N$ $x$\n$a_1$ $a_2$ $...$ $a_N$\n\n[samples]","is_translate":false,"language":"English"}],"meta":{"iden":"arc064_a","tags":[],"sample_group":[["3 3\n2 2 2","1\n\nEat one candy in the second box. Then, the number of candies in each box becomes $(2, 1, 2)$."],["6 1\n1 6 1 2 0 4","11\n\nFor example, eat six candies in the second box, two in the fourth box, and three in the sixth box. Then, the number of candies in each box becomes $(1, 0, 1, 0, 0, 1)$."],["5 9\n3 1 4 1 5","0\n\nThe objective is already achieved without performing operations."],["2 0\n5 5","10\n\nAll the candies need to be eaten."]],"created_at":"2026-03-03 11:01:14"}}