Algorithms and Data Structures

  • Profound Academy

    • Status
      • 1
        Implementation
      • 2
        Bitwise operations
      • 3
        Prefix Sums
      • 4
        Sliding window / Two pointers
      • 5
        Modular Arithmetic
      • 6
        Number Theory
      • 7
        Binary Search
      • 8
        Basic Sorting
      • 9
        Greedy Algorithms
      • 10
        Basic Dynamic Programming
      • 11
        Recursion
      • 12
        Linked LIst
      • 13
        Queue & Stack
      • 14
        Binary tree + BST
      • 15
        Divide & Conquer + Advanced Sorting
      • 16
        Heap
      • 17
        Hashing
      • 18
        Graph Representation
      • 19
        BFS

    • Make it non-decreasing

    Given an array of n integers, you are asked to make it non-decreasing. You are allowed to add 1 to any element in the array as many times as you want. Each time you add 1 to an element, you pay $1. You’d like to make the array non-decreasing but with minimal cost. Can you calculate the minimum amount it will cost you to transform the array?

    Input

    The first line of the input contains a single integer n (2 ≤ n ≤ ) - the number of elements in the array.
    The second line of the input contains n space-separated integers ( ≤ ≤ ) - array elements.

    Output

    The program should print the minimal cost to transform the array into a non-decreasing sequence of numbers.

    Examples

    Input
    Output
    4 -2 3 1 0
    5
    5 1 2 3 4 4
    0
     

    Constraints

    Time limit: 1 seconds

    Memory limit: 512 MB

    Output limit: 1 MB

    To check your solution you need to sign in
    Sign in to continue