hdu5489 Removed Interval LIS

题意：移掉长度为L的区间后剩余数组的LIS

#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<math.h>
#include<set>
#include<map>
#include<stack>
#include<vector>
#include<queue>
using namespace std;
typedef unsigned long long ll;
const int N=1e5+10;
const int INF=0x3f3f3f3f;
int a[N],st[N],tot;
int n,m;
int f[N],g[N];
void solve(){
    if(n==m){
        puts("0");return;
    }
    memset(st,0x3f,(n+1)*sizeof(st[0]));
    tot=0;f[n+1]=0;st[0]=-INF;
    a[n+1]=INF;
    for(int i=n;i>=1;i--){
        if(-a[i]>st[tot]){
            st[++tot]=-a[i];
            f[i]=tot;
            continue;
        }
        int cnt=lower_bound(st,st+1+tot,-a[i])-st;
        st[cnt]=min(st[cnt],-a[i]);
        f[i]=cnt;
    }
    //for(int i=1;i<=n;i++)printf("%d,",f[i]);
    memset(st,0x3f,(n+1)*sizeof(st[0]));st[0]=-INF;
    int ans=1,temp,l,r;
    for(int i=1;i+m<=n+1;i++){
        r=f[i+m];l=lower_bound(st,st+n,a[i+m])-st;
        ans=max(ans,l+r-1);
        int cnt=lower_bound(st,st+n,a[i])-st;
        st[cnt]=min(st[cnt],a[i]);
    }
    printf("%d\n",ans);
}
void work(){
    int T;
    int tt=1;
    scanf("%d",&T);
    int D;
    while(T--){
        scanf("%d%d",&n,&m);
        printf("Case #%d: ",tt++);
        for(int i=1;i<=n;i++)
            scanf("%d",&a[i]);
        solve();
    }
}
int main(){
    //freopen("data_in.txt","r",stdin);
    work();
    return 0;
}