summaryrefslogtreecommitdiff
path: root/introductory_problems/readme.md
diff options
context:
space:
mode:
authorJack Sangdahl <[email protected]>2024-12-18 10:56:22 -0700
committerJack Sangdahl <[email protected]>2024-12-18 10:56:22 -0700
commitc922967b8b2ce6ec78effbc54ae0700c7af1e875 (patch)
tree580cf8da46c5da928307c72a8fc00b999c1795d8 /introductory_problems/readme.md
parentb4c9537fd8f13fcfc990f03b3731950fb6ae3759 (diff)
downloadcses-c922967b8b2ce6ec78effbc54ae0700c7af1e875.tar.gz
cses-c922967b8b2ce6ec78effbc54ae0700c7af1e875.zip
1094. increasing array
Diffstat (limited to 'introductory_problems/readme.md')
-rw-r--r--introductory_problems/readme.md7
1 files changed, 7 insertions, 0 deletions
diff --git a/introductory_problems/readme.md b/introductory_problems/readme.md
index 78e52cb..cca3339 100644
--- a/introductory_problems/readme.md
+++ b/introductory_problems/readme.md
@@ -20,3 +20,10 @@ You are given a DNA sequence: a string consisting of A, C, G, and T. Your task i
**Input**: The only input line contains a string of `n` characters. (Example: ATTCGGGA)
**Output**: Print one integer: the length of the longest repetition. (Example: 3)
+
+### Increasing Array
+You are given an array of `n` integers. You want to modify the array so that it is increasing, ie. every element is at least as large as the previous element. On each move, you may increase the value of any elementby one. What is the minimum number of moves required?
+
+**Input**: Thefirst input line contains an integer `n`: the size of the array. Then the second line contains `n` integers: the contents of the array. (Example: 5`\n`3 2 5 1 7)
+
+**Output**: Print the minimum number of moves. (Example: 5)