STL 实现最长上升，最长递减序列

#include<bits/stdc++.h>


using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> P;
#define fi first
#define se second
#define INF 0x3f3f3f3f
#define clr(x,y) memset(x,y,sizeof x)
#define PI acos(-1.0)
#define ITER set<int>::iterator
const int Mod = 1e9 + 7;
const int maxn = 2e5 + 10;


int a[maxn];

int n;
const int N = 131072;
template<class Cmp>
int LIS (Cmp cmp)
{
    static int m, ends[N];
    m = 0;
    for (int i=0;i<n;i++)
    {
        int pos = lower_bound(ends, ends+m, a[i], cmp)-ends;
        ends[pos] = a[i], m += pos==m;
    }
    return m;
}

bool greater1(int value)
{
    return value >=1;
}




int main()
{
    while(~ scanf("%d",&n))
    {
        for(int i=0;i<n;i++)
            scanf("%d",&a[i]);
        int len1 = LIS(less<int>()),//严格递增
        len2 = LIS(less_equal<int>()),//非严格递增
        len3 = LIS(greater<int>()),//严格递减
        len4 = LIS(greater_equal<int>());//非严格递减
    }
    return 0;
}