Given an array . find two disjoint segments of given length such that their total sum is max

Given an array . find two disjoint segments of given length such that their total sum is max . please tell an efficient approach