{"problem":{"name":"Grand Garden","description":{"content":"In a flower bed, there are $N$ flowers, numbered $1,2,......,N$. Initially, the heights of all flowers are $0$. You are given a sequence $h={h_1,h_2,h_3,......}$ as input. You would like to change the","description_type":"Markdown"},"platform":"AtCoder","limit":{"time_limit":2000,"memory_limit":262144},"difficulty":"None","is_remote":true,"is_sync":true,"sync_url":null,"sign":"abc116_c"},"statements":[{"statement_type":"Markdown","content":"In a flower bed, there are $N$ flowers, numbered $1,2,......,N$. Initially, the heights of all flowers are $0$. You are given a sequence $h={h_1,h_2,h_3,......}$ as input. You would like to change the height of Flower $k$ to $h_k$ for all $k$ $(1 \\leq k \\leq N)$, by repeating the following \"watering\" operation:\n\n*   Specify integers $l$ and $r$. Increase the height of Flower $x$ by $1$ for all $x$ such that $l \\leq x \\leq r$.\n\nFind the minimum number of watering operations required to satisfy the condition.\n\n## Constraints\n\n*   $1 \\leq N \\leq 100$\n*   $0 \\leq h_i \\leq 100$\n*   All values in input are integers.\n\n## Input\n\nInput is given from Standard Input in the following format:\n\n$N$\n$h_1$ $h_2$ $h_3$ $......$ $h_N$\n\n[samples]","is_translate":false,"language":"English"}],"meta":{"iden":"abc116_c","tags":[],"sample_group":[["4\n1 2 2 1","2\n\nThe minimum number of watering operations required is $2$. One way to achieve it is:\n\n*   Perform the operation with $(l,r)=(1,3)$.\n*   Perform the operation with $(l,r)=(2,4)$."],["5\n3 1 2 3 1","5"],["8\n4 23 75 0 23 96 50 100","221"]],"created_at":"2026-03-03 11:01:14"}}