Location:
Search - BOJ 10
Search list
Description: 北邮ACM第1007题的程序，已通过测试，绝对可用。-Beijing University of Posts and Telecommunications ACM theme of the first 1007 program, has been tested, absolutely free.
Platform: |
Size: 133120 |
Author: 王志刚 |
Hits:
Description: BOJ1004：现在有一个数列，需要你求得该数列满足下述要求的最长子数列。子数列要求：这个子数列可以被分成前后两个部分，且两部分共同拥有一个数列项（即前一部分的最后一个数列项和后一部分的第一个数列项是同一个数列项）；子数列的前一部分各项要严格递增，后一部分各项要严格递减。例如，数列 1 4 6 5 2 1 可以分成 1 4 6 和 6 5 2 1 这两部分。他们都含有数列项 6 ，且前者各项严格递增，后者各项严格递减。-There is now a series, you need to obtain the series meet the following requirements of the longest sub-series. Sub-series Requirements: This sub-series may be divided into before and after the two parts, and the two share a series of items (ie the first part of the last series of items and the last part of the first number listed item is same number of column item) sub-series The first part should be strictly increasing, the last part of the strictly decreasing. For example, series 146 521 can be divided into 146 and 6521 these two. They contain a series of item 6, and the former is the strictly increasing, which is the strictly decreasing.
Platform: |
Size: 1024 |
Author: 小获 |
Hits: