最大覆盖问题:给定n 个整数n a , a , ,a 1 2  组成的序列，试设计一个O(n)时间算法，计算其最大覆盖 区间长度。-Maximum cover problem: Given n integers na, a,, a 1 2  composed of a sequence and try to design an O (n) time algorithm to calculate the maximum length of coverage ran