Problema
One move increases one array value by 1. Make the array nondecreasing: each value must be greater than or equal to the one immediately before it. You may not decrease values or reorder them.
Implement increasing_array(numbers).
Input
numbers: The values in their original order.
Output
Return the minimum total number of unit increments.
Restricciones
1 ≤ length ≤ 200,000. Each value is between 1 and 1,000,000,000. Use a signed 64-bit result.
Ejemplos
Entrada:
numbers = [4, 1, 3]
Salida esperada:
expected = 4Entrada:
std::vector<long long> numbers = {4, 1, 3};
Salida esperada:
long long expected = 4;Entrada:
long[] numbers = new long[] {4, 1, 3};
Salida esperada:
long expected = 4;Explicación
Raise 1 to 4 using three moves and 3 to 4 using one move. The result [4, 4, 4] uses four moves.
Entrada:
numbers = [1, 2, 2, 5]
Salida esperada:
expected = 0Entrada:
std::vector<long long> numbers = {1, 2, 2, 5};
Salida esperada:
long long expected = 0;Entrada:
long[] numbers = new long[] {1, 2, 2, 5};
Salida esperada:
long expected = 0;Explicación
Every value is already at least the preceding value; equal neighbors are allowed.
Cómo abordarlo
Inténtalo primero por tu cuenta y luego abre las pistas una a una.
Pista 1
Scan from left to right, because each value only depends on the previous one.
Pista 2
Whenever a value is too small, raise it just enough to match the running minimum allowed value.
Pista 3
Track the total increments carefully, since earlier increases affect later comparisons.
Complejidad esperada
O(n) time, O(1) extra space
Referencias
Este reto está adaptado para CodeUtility. Sigue el enunciado y las restricciones indicadas arriba.