4种基础lis变形

#include <bits/stdc++.h>

using namespace std;


const int N = 1E5 + 7, INF = 0x3f3f3f3f;

int a[N], dp[N];
int n;

int p1() //严格上升
{
    int len = 1;
    memset(dp, 0x3f, sizeof(dp));
    dp[1] = a[1];
    for(int i = 2; i <= n ;i ++) {
        if(a[i] > dp[len]) {
            dp[++len] = a[i];
        } else {
            int pos = lower_bound(dp + 1, dp + 1 + len, a[i]) - dp;
            dp[pos] = a[i];
        }
    }
    return len;
}

int p2() //非递减
{
    int len = 1;
    memset(dp, 0x3f, sizeof(dp));
    dp[1] = a[1];
    for(int i = 2; i <= n ;i ++) {
        if(a[i] >= dp[len]) {
            dp[++len] = a[i];
        } else {
            int pos = upper_bound(dp + 1, dp + 1 + len, a[i]) - dp;
            dp[pos] = a[i];
        }
    }
    return len;
}

int rp1() //严格递减
{
    int len = 1;
    fill(dp + 1, dp + 1 + n, -INF);
    dp[1] = a[1];
    for(int i = 2; i <= n; i ++) {
        if(a[i] < dp[len]) {
            dp[++len] = a[i];
        } else {
            int pos = lower_bound(dp + 1, dp + 1 + len, a[i], greater<int>()) - dp;
            dp[pos] = a[i];
        }
    }
    return len;
}

int rp2() //严格非递增
{
    int len = 1;
    fill(dp + 1, dp + 1 + n, -INF);
    dp[1] = a[1];
    for(int i = 2; i <= n; i ++) {
        if(a[i] <= dp[len]) {
            dp[++len] = a[i];
        } else {
            int pos = upper_bound(dp + 1, dp + 1 + len, a[i], greater<int>()) - dp;
            dp[pos] = a[i];
        }
    }
    return len;
}
int main()
{
    scanf("%d", &n);
    for(int i = 1; i <= n; i ++) scanf("%d", &a[i]) ;
    cout << p1() << " " << p2() << " "<< rp1()<< " " << rp2() << endl;
    return 0;
}