HDU 4521

求长度为 n 间距大于 d 的最长上升序列

正常思路

由于数据超过 1e5 得线段树优化一下了

。。。。

 

 

 

 

 

 

 

#include<iostream>
#include<cstdio>
#include<cstring>
using namespace std;
#define lson l,m,rt<<1
#define rson m+1,r,rt<<1|1
const int maxn = 1e5+5;
const int INF = 0x3f3f3f3f;
int num[maxn<<2];
int dp[maxn<<2];
int a[maxn];
void pushup(int rt)
{
    num[rt] = max(num[rt<<1], num[rt<<1|1]);
}
void build(int l,int r,int rt)
{
    num[rt] = 0;
    if(l == r)
        return;
    int m = (l+r)/2;
    build(lson);
    build(rson);
}
void update(int pos,int c,int l,int r,int rt)
{
    if(l == r)
    {
        num[rt] = max(num[rt], c);
        return;
    }
    int m = (l+r)/2;
    if(pos <= m)
        update(pos,c,lson);
    if(pos > m)
        update(pos,c,rson);
    pushup(rt);
}
int query(int L,int R,int l,int r,int rt)
{
    if(L <= l && R >= r)
    {
        return num[rt];
    }
    int m = (l+r)/2;
    int res = 0;
    if(L <= m)
        res = max(res, query(L,R,lson));
    if(R > m)
        res = max(res, query(L,R,rson));
    return res;
}
int main()
{
    int n,d;
    while(~scanf("%d%d",&n,&d))
    {
        build(0,maxn,1);
        for(int i=1;i<=n;i++)
            dp[i] = 1;
        int ans = 1;
        for(int i=1;i<=n&&i<=d;i++)
        {
            scanf("%d",&a[i]);
        }
        for(int i=d+1;i<=n;i++)
        {
            scanf("%d",&a[i]);
            if(a[i] > 0)
                dp[i] = query(0,a[i]-1,0,maxn,1) + 1;
            else
                dp[i] = 1;
            update(a[i-d],dp[i-d],0,maxn,1);
            ans = max(ans, dp[i]);
        }
        printf("%d\n",ans);
    }
    return 0;
}