Tap here to switch tabs
Problem
Submissions

Problem: Minimum Increments on Subarrays to Form a Target Array

Minimum Increments on Subarrays to Form a Target Array asks how many operations are needed to turn an all-zero array into the target by incrementing any contiguous subarray by one each time.

Statement

You are given an integer array target. You have an array initial of the same length where every element is initially 00.

In a single operation, you can select any contiguous subarray of initial and increment each of its elements by 11.

Return the minimum number of operations required to transform initial into target.

Constraints:

  • 1≤1 \leq target.length ≤105\leq 10^5

  • 1≤1 \leq target[i] ≤105\leq 10^5

  • The input is generated such that the answer fits inside a 3232 bit integer.

⋮
Tap here to switch tabs
Problem
Submissions

Problem: Minimum Increments on Subarrays to Form a Target Array

Minimum Increments on Subarrays to Form a Target Array asks how many operations are needed to turn an all-zero array into the target by incrementing any contiguous subarray by one each time.

Statement

You are given an integer array target. You have an array initial of the same length where every element is initially 00.

In a single operation, you can select any contiguous subarray of initial and increment each of its elements by 11.

Return the minimum number of operations required to transform initial into target.

Constraints:

  • 1≤1 \leq target.length ≤105\leq 10^5

  • 1≤1 \leq target[i] ≤105\leq 10^5

  • The input is generated such that the answer fits inside a 3232 bit integer.