小明系列问题――小明序列(LIS)

#include<bits/stdc++.h>
using namespace std;
const int M = 1e5 + 10 , inf = 0x3f3f3f3f;
int n , d ;
int a[M] , Top[M] , maxn[M];
int judge (int x) {
        int l = 0 , r = n ;
        int ret = l ;
        while (l <= r) {
                int mid = l + r >> 1 ;
                if (x > Top[mid]) {
                        l = mid+1 ;
                        ret = mid ;
                }
                else r = mid-1 ;
        }
        return ret+1 ;
}

void solve () {
        int ans = 0 ;
        for (int i = 1 ; i <= n ; i ++) {
                maxn[i] = judge (a[i]) ;
                ans = max (maxn[i] , ans) ;
                int j = i-d ;
                if (j > 0) Top[ maxn[j] ] = min (Top[ maxn[j] ] , a[j] ) ;
        }
        printf ("%d\n" , ans ) ;
}

int main () {
        while (~ scanf ("%d%d" , &n , &d)) {
                Top[0] = -inf ;
                for (int i = 1 ; i <= n ; i ++) {
                        scanf ("%d" , &a[i]) ;
                        Top[i] = inf ;
                }
                solve () ;
        }
        return 0 ;
}