[POI 2007] 堆积木

[题目链接]

https://www.lydsy.com/JudgeOnline/problem.php?id=1109

[算法]

DP

[代码]

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

struct info
{
        int x,y;
} b[MAXN];

int i,n,m,cnt,pos;
int a[MAXN],q[MAXN];

inline bool cmp(info a,info b)
{
        return a.x == b.x ? a.y < b.y : a.x < b.x;
}

int main()
{

        scanf("%d",&n);
        for (i = ; i <= n; i++)
        {
                scanf("%d",&a[i]);
                if (i - a[i] < ) continue;
                b[++m].x = i - a[i];
                b[m].y = a[i];
        }
        sort(b+,b+m+,cmp);
        for (i = ; i <= m; i++)
        {
                if (i ==  || b[i].y > q[cnt]) q[++cnt] = b[i].y;
                else
                {
                        pos = lower_bound(q+,q+cnt+,b[i].y) - q;
                        q[pos] = b[i].y;
                }
        }

        printf("%d\n",cnt);

        return ;

}