HDU 5489 Removed Interval 2015 ACM/ICPC Asia Regional Hefei Online

#include<bits/stdc++.h>
using namespace std;


const int maxn = 1e5+5;
int a[maxn];
int g[maxn];
int f[maxn];

const int INF = 0x3f3f3f3f;

//#define LOCAL
int main()
{
#ifdef LOCAL
    freopen("in.txt","r",stdin);
#endif
    int T; scanf("%d",&T);
    for(int ks = 1; ks <= T; ks++){
        int N,L,k ; scanf("%d%d",&N,&L);
        for(int i = 0; i < N; i++) scanf("%d",a+i);
        fill(g+1,g+N-L+1,-INF);
        for(int i = N-1; i >= L; i--){
            k = lower_bound(g+1,g+N-i,a[i],greater<int>())-g;
            f[i] = k;
            g[k] = a[i];
        }
        memset(g+1,0x3f,sizeof(int)*(N-L));
        int ans = 0;
        for(int i = L; i < N; i++){
            k = lower_bound(g+1,g+i-L+1,a[i])-g;
            ans = max(k-1+f[i],ans);
            k = lower_bound(g+1,g+i-L+1,a[i-L])-g;
            ans = max(k,ans);
            g[k] = a[i-L];
        }
        printf("Case #%d: %d\n",ks,ans);
    }
    return 0;
}