title: Find max sum of elements in array
body: <p>Write a program which by given array of integer values (containing negative integers) finds the maximum sum of successive elements in the array.</p>
  
  <p>Example:</p>
  
  <blockquote>
    <p>2, 3, -6, -1, <strong>2, -1, 6, 4</strong>, -8, 8</p>
  </blockquote>
  
  <p>Gives</p>
  
  <blockquote>
    <p>11</p>
  </blockquote>
  
  <p>I am searching for a solution which is faster than O(N^2).</p>