#####   ######  #####    ###    #   #  ###  #   #  ######
##  ##  ##      ##  ##  ## ##   #   #   #   #   #  ##
#####   ####    #####   #   #   #   #   #   #   #  ####
##  #   ##      ##      ## ##    # #    #    # #   ##
##   #  ######  ##       ###      #    ###    #    ######

$ curl repovive.com/roadmaps/cpp/stl-algorithms/arrival-implementation

░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░██████████████████████████████████████████████████████████████████████

#####   ######  #####    ###    #   #  ###  #   #  ######
##  ##  ##      ##  ##  ## ##   #   #   #   #   #  ##
#####   ####    #####   #   #   #   #   #   #   #  ####
##  #   ##      ##      ## ##    # #    #    # #   ##
##   #  ######  ##       ###      #    ###    #    ######

$ curl repovive.com/roadmaps/cpp/stl-algorithms/arrival-implementation

Repovive

Arrival - Implementation - STL Algorithms | C++ | Repovive

Repovive.

C++20 sections · 1034 units68h total

Open in Course

Arrival - Implementation

Complete solution


plaintext
function arrival_general(heights)
 n := size of heights
 max_pos := index of max_element(heights)
 min_pos := index of min_element(heights)
 swaps := max_pos + (n - 1 - min_pos)
 if max_pos > min_pos then
 swaps := swaps - 1
 return swaps

The max_element() and min_element() functions return iterators pointing to the elements. The time complexity is $O(n)$ where $n$ is the number of soldiers.