TLE求调

#include <iostream>
#include <cstring>
#include <algorithm>
#include <cstdio>

using namespace std;

const int N = 1e5 + 5;

int a[N], f[N], h[N], G[N], m, s;

int main() {
    int n = 1;
    while (scanf("%d", &a[n])) n ++;
    n --;
    
    for (int i = 1; i <= n; i ++) {

        if (s == 0 || G[s] < a[i]) G[++ s] = a[i];
        else {
            int p = 0;
            for (int j = 20; j >= 0; j --) {
                if ((p | 1 << j) <= s && G[p | 1 << j] < a[i])
                    p |= 1 << j;
            }
            G[p + 1] = a[i];
        }

        f[i] = 1;

        int p = 0;
        for (int j = 20; j >= 0; j --) {
            if ((p | (1 << j)) <= m && h[p | 1 << j] >= a[i]) 
                p |= 1 << j;
        }
        if (p != 0) f[i] = p + 1;
        m = max(m, f[i]);
        h[f[i]] = max(h[f[i]], a[i]);
    }

    int ans = 0;
    for (int i = 1; i <= n; i ++) ans = max(ans, f[i]);
    cout << ans << endl << s;
    return 0;
}