title: Finding the longest down sequence in a Java array
body: <p>Given this array </p>
  
  <pre><code>int [] myArray = {5,-11,2,3,14,5,-14,2};
  </code></pre>
  
  <p>I must be able to return 3 because the longest down sequence is 14,5,-14.
  What's the fastest way to do this?</p>
  
  <p>PS: Down sequence is a series of non-increasing numbers.</p>