HDU5532 Almost Sorted Array 最长上升子序列、暴力
Almost Sorted Array
We are all familiar with sorting algorithms: quick sort, merge sort, heap sort, insertion sort, selection sort, bubble sort, etc. But sometimes it is an overkill to use these algorithms for an almost sorted array.
We say an array is sorted if its elements are in non-decreasing order or non-increasing order. We say an array is almost sorted if we can remove exactly one element from it, and the remaining array is sorted. Now you are given an array a1,a2,…,ana1,a2,…,an, is it almost sorted?
Input
The first line contains an integer TT indicating the total number of test cases. Each test case starts with an integer nn in one line, then one line with nn integers a1,a2,…,ana1,a2,…,an.
1≤T≤20001≤T≤2000
2≤n≤1052≤n≤105
1≤ai≤1051≤ai≤105
There are at most 20 test cases with n>1000n>1000.
Output
For each test case, please output "`YES`" if it is almost sorted. Otherwise, output "`NO`" (both without quotes).
Sample Input
3
3
2 1 7
3
3 2 1
5
3 1 4 1 5Sample Output
YES
YES
NO题意：
给一个n个数的序列，问去掉一个数字，能否构成不上升或者不下降序列
分析：
判断原序列的最长不上升子序列长度，和最长不下降子序列长度，若len>=n-1,输出YES，否在NO。
最长上升子序列（LIS）算法
#include
#include
#include
#include
#include
#include
#include
#include
#include 还有一种是O(N) 对于每一个数，要么呈现V形或者^形，或者单调，记录上升下降次数，我们对删除某个数所造成影响记录下来，假如删除它致使最后上升次数或者下降次数满足n-2次就行了
#include
#include
#include
#include
#include
#include
#include
#include
#include