Description: Try using a circulating written request queue order k Fibonacci sequence algorithm that deed before n+1 items. Required to meet:, where the agreement for a constant max. (Note: This question of the capacity of only circular queue element k, then at the end of the algorithm execution, stay in the loop with the queue should be a sequence of k-th Fibonacci seeking the last k items)
To Search:
File list (Check if you may need any files):
3.3.cpp
Download