Maximum Sum of Non-adjacent Elements

Given an array of integers, find the maximum sum of non-adjacent elements. That is, you should compute the maximum sum of elements in the array such that you skip at least one element between each picked element.