Description: First to open a larger space for the array, starting from the end of the array. Comparison of the last number and the most
Early to set a maximum value in the array, making a minimal sequence and the sequence of a minimal initialization. A minimal sequence number recorded in the current location, and then continue to work with in front of the adjacent number to compare. If the latter than the former, the size of the minimal sequence number of compare the two brought into the record, if the latter holds the minimal sequence number is greater than the former, the latter as a benchmark, a minimal sequence remains unchanged. On the contrary, is the latter sub-sequence number from plus one to change it held before the minimal sequence number. Continue to repeat the previous action, and finally arrive at the number and content of up to drop the sub-sequence.
To Search:
File list (Check if you may need any files):
sub-sequence\sub-sequence.cpp
sub-sequence
Download