Sliding window — maximum sum subarray of size k

You need the maximum sum among every contiguous subarray of exactly length k in one pass. What stays true as the window moves?