package main

// Given an unsorted array of integers numbers,
// return (one of) the longest continuous decreasing subsequence (i.e. subarray).
// The subsequence must be strictly decreasing.

// Example:
// f([12, 9, 10, 8, 6, 5, 3, 4, 2, 1]) => [10, 8, 6, 5, 3]
// f([3, 2, 1]) => [3, 2, 1]
// f([1, 2, 3]) => [1] or [2] or [3]
