time complexity of O (nlogn) of the longest-monotonically increasing sequence of the program. Is not dynamic programming algorithm. In a minute can be calculated n = 10 ^ 6 elements of incremental sequences.

LISS_FAST
.........\Debug
.........\liss.cpp
.........\LISS.dsp
.........\LISS.dsw
.........\LISS.ncb
.........\LISS.opt
.........\LISS.plg
.........\liss104.txt
.........\liss105.txt
.........\liss_new.cpp
.........\test.txt
.........\test1.txt
.........\test100.txt

• We are an exchange download platform that only provides communication channels. The downloaded content comes from the internet. Except for download issues, please Google on your own.
• The downloaded content is provided for members to upload. If it unintentionally infringes on your copyright, please contact us.
• Please use Winrar for decompression tools
• If download fail, Try it againg or Feedback to us.
• If downloaded content did not match the introduction, Feedback to us，Confirm and will be refund.
• Before downloading, you can inquire through the uploaded person information

Nothing．