{"problem":{"name":"C. Riverside Curio","description":{"content":"Arkady decides to observe a river for _n_ consecutive days. The river's water level on each day is equal to some real value. Arkady goes to the riverside each day and makes a mark on the side of the ","description_type":"Markdown"},"platform":"Codeforces","limit":{"time_limit":1000,"memory_limit":262144},"difficulty":"None","is_remote":true,"is_sync":true,"sync_url":null,"sign":"CF956C"},"statements":[{"statement_type":"Markdown","content":"Arkady decides to observe a river for _n_ consecutive days. The river's water level on each day is equal to some real value.\n\nArkady goes to the riverside each day and makes a mark on the side of the channel at the height of the water level, but if it coincides with a mark made before, no new mark is created. The water does not wash the marks away. Arkady writes down the number of marks strictly above the water level each day, on the _i_\\-th day this value is equal to _m__i_.\n\nDefine _d__i_ as the number of marks strictly under the water level on the _i_\\-th day. You are to find out the minimum possible sum of _d__i_ over all days. There are no marks on the channel before the first day.\n\n## Input\n\nThe first line contains a single positive integer _n_ (1 ≤ _n_ ≤ 105) — the number of days.\n\nThe second line contains _n_ space-separated integers _m_1, _m_2, ..., _m__n_ (0 ≤ _m__i_ < _i_) — the number of marks strictly above the water on each day.\n\n## Output\n\nOutput one single integer — the minimum possible sum of the number of marks strictly below the water level among all days.\n\n[samples]\n\n## Note\n\nIn the first example, the following figure shows an optimal case.\n\nNote that on day 3, a new mark should be created because if not, there cannot be 3 marks above water on day 4. The total number of marks underwater is 0 + 0 + 2 + 0 + 3 + 1 = 6.\n\nIn the second example, the following figure shows an optimal case.\n\n","is_translate":false,"language":"English"}],"meta":{"iden":"CF956C","tags":["data structures","dp","greedy","implementation"],"sample_group":[["6\n0 1 0 3 0 2","6"],["5\n0 1 2 1 2","1"],["5\n0 1 1 2 2","0"]],"created_at":"2026-03-03 11:00:39"}}