poj 1796 线段树+dp

题意、解析：

见《挑战》P206

书上代码不全，此处完全为了记录代码。

代码：

#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <cstring>
#include <cmath>
#include <stack>
#include <vector>
#include <queue>
#include <map>
#include <set>
#include <climits>
#include <cassert>
#define LL long long
#define lson lo, mi, rt << 1
#define rson mi + 1, hi, rt << 1 | 1

using namespace std;
const int maxn = 50000 + 10;
const int maxm = 500000 + 10;
const int inf = 0x3f3f3f3f;
const double eps = 1e-8;
const double pi = acos(-1.0);
const double ee = exp(1.0);

int dp[maxn << 2];
bool rtFlag;
int n, m;

void pushup(int rt)
{
    dp[rt] = min(dp[rt << 1], dp[rt << 1 | 1]);
}

void build(int lo, int hi, int rt)
{
    dp[rt] = inf;
    if (lo == hi)
    {
        return;
    }
    int mi = (lo + hi) >> 1;
    build(lson);
    build(rson);
    pushup(rt);
}

void update(int pos, int num, int lo, int hi, int rt)
{
    if (lo == hi)
    {
//        dp[rt] = num;
        if (num < dp[rt])
            dp[rt] = num;
        return;
    }
    int mi = (lo + hi) >> 1;
    if (pos <= mi)
        update(pos, num, lson);
    else
        update(pos, num, rson);
    pushup(rt);
}

int query(int L, int H, int lo, int hi, int rt)
{
    if (L <= lo && hi <= H)
    {
        return dp[rt];
    }
    int mi = (lo + hi) >> 1;
    int res = inf;///...
    if (L <= mi)
        res = min(res, query(L, H, lson));
    if (mi < H)
        res = min(res, query(L, H, rson));
    return res;
}

int main()
{
#ifdef LOCAL
    freopen("in.txt", "r", stdin);
#endif // LOCAL
    while (~scanf("%d%d", &n, &m))
    {
        build(1, n, 1);
        update(1, 0, 1, n, 1);
        for (int i = 0; i < m; i++)
        {
            int s, t;
            scanf("%d%d", &s, &t);
            int minx = query(s, t - 1, 1, n, 1);
            if (minx != inf)
            {
                update(min(n, t), minx + 1, 1, n, 1);
            }
        }
        printf("%d\n", query(n, n, 1, n, 1));
    }
    return 0;
}