Description: 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 range.
To Search:
File list (Check if you may need any files):
cove.cpp
cove.pdf
Download