POJ 1661 Help Jimmy

题意：Jimmy要从高处移动到地面，其中有n个平台，在一个平台上可以从两边跳下，每移动一个单位距离花费1秒，下落时速度也为1单位/秒,每次下落的高度不能超过h，求Jimmy到底面的最短时间。

链接：http://poj.org/problem?id=1661

思路：记忆化搜索，每个跳板两端只能落在后面的一个跳板上，按高度排序之后直接搜索，记录每块跳板两端的最小值

注意点：无

以下为AC代码：

Run ID	User	Problem	Result	Memory	Time	Language	Code Length	Submit Time
14186472	luminous11	1661	Accepted	676K	16MS	G++	4659B	2015-05-12 14:15:08

#include <iostream>
#include <cstdio>
#include <string>
#include <cstring>
#include <iostream>
#include <cstring>
#include <cstdio>
#include <string>
#include <vector>
#include <deque>
#include <list>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <cmath>
#include <ctime>
#include <cctype>
#include <climits>
#include <iomanip>
#include <cstdlib>
#include <algorithm>
//#include <unordered_map>
//#include <unordered_set>
#define ll long long
#define ull unsigned long long
#define all(x) (x).begin(), (x).end()
#define clr(a, v) memset( a , v , sizeof(a) )
#define pb push_back
#define RDI(a) scanf ( "%d", &a )
#define RDII(a, b) scanf ( "%d%d", &a, &b )
#define RDIII(a, b, c) scanf ( "%d%d%d", &a, &b, &c )
#define RS(s) scanf ( "%s", s )
#define PI(a) printf ( "%d", a )
#define PIL(a) printf ( "%d\n", a )
#define PII(a,b) printf ( "%d %d", a, b )
#define PIIL(a,b) printf ( "%d %d\n", a, b )
#define PIII(a,b,c) printf ( "%d %d %d", a, b, c )
#define PIIIL(a,b,c) printf ( "%d %d %d\n", a, b, c )
#define PL() printf ( "\n" )
#define PSL(s) printf ( "%s\n", s )
#define rep(i,m,n) for ( int i = m; i <  n; i ++ )
#define REP(i,m,n) for ( int i = m; i <= n; i ++ )
#define dep(i,m,n) for ( int i = m; i >  n; i -- )
#define DEP(i,m,n) for ( int i = m; i >= n; i -- )
#define repi(i,m,n,k) for ( int i = m; i <  n; i += k )
#define REPI(i,m,n,k) for ( int i = m; i <= n; i += k )
#define depi(i,m,n,k) for ( int i = m; i >  n; i += k )
#define DEPI(i,m,n,k) for ( int i = m; i >= n; i -= k )
#define READ(f) freopen(f, "r", stdin)
#define WRITE(f) freopen(f, "w", stdout)
using namespace std;
const double pi = acos(-1);
template <class T>
inline bool RD ( T &ret )
{
    char c;
    int sgn;
    if ( c = getchar(), c ==EOF )return 0; //EOF
    while ( c != '-' && ( c < '0' || c > '9' ) ) c = getchar();
    sgn = ( c == '-' ) ? -1 : 1;
    ret = ( c == '-' ) ? 0 : ( c - '0' );
    while ( c = getchar() , c >= '0' && c <= '9' ) ret = ret * 10 + ( c - '0' );
    ret *= sgn;
    return 1;
}
inline void PD ( int x )
{
    if ( x > 9 ) PD ( x / 10 );
    putchar ( x % 10 + '0' );
}
const double eps = 1e-10;
const int dir[4][2] = { 1,0, -1,0, 0,1, 0,-1 };
struct node{
    int l, r, h;
    node(){}
    node( int _x, int _y ) : l(_x), r(_y) {}
    node( int _x, int _y, int _cnt ) : l(_x), r(_y), h(_cnt) {}
    friend bool operator < ( const node &a, const node &b ){
        if ( a.h != b.h )
            return a.h > b.h;
        else
            return a.l < b.l;
    }
};
node t[1005];
node num[1005];
int n, x, y, _max;
int ans;
void dfs ( int k, int lt, int rt )
{
    if ( k == n + 1 ){
        ans = min ( ans, min ( lt, rt ) );
        return;
    }
    REP ( i, k + 1, n + 1 ){
        if ( i == n + 1 ){ num[i].l = num[k].l; num[i].r = num[k].l; }
        if ( num[k].h - num[i].h > _max )break;
        if ( num[k].l >= num[i].l && num[k].l <= num[i].r ){
            int tmplt = lt + num[k].h - num[i].h + abs( num[k].l - num[i].l );
            int tmprt = lt + num[k].h - num[i].h + abs( num[k].l - num[i].r );
            if ( tmplt >= t[i].l && tmprt >= t[i].r )break;
            t[i] = node( min ( t[i].l, tmplt ), min ( t[i].r, tmprt ) );
            //printf ( "%d %d %d %d \n", k, i, t[i].l, t[i].r );
            dfs ( i, tmplt, tmprt );
            break;
        }
    }
    REP ( i, k + 1, n + 1 ){
        if ( i == n + 1 ){ num[i].l = num[k].r; num[i].r = num[k].r; }
        if ( num[k].h - num[i].h > _max )break;
        if ( num[k].r >= num[i].l && num[k].r <= num[i].r ){
            int tmplt = rt + num[k].h - num[i].h + abs( num[k].r - num[i].l );
            int tmprt = rt + num[k].h - num[i].h + abs( num[k].r - num[i].r );
            if ( tmplt >= t[i].l && tmprt >= t[i].r ) break;
            t[i] = node( min ( t[i].l, tmplt ), min ( t[i].r, tmprt ) );
            //printf ( "%d %d %d %d \n", k, i, t[i].l, t[i].r );
            dfs ( i, tmplt, tmprt );
            return;
        }
    }
}
int main()
{
    int ncase;
    RDI ( ncase );
    while ( ncase -- ){
        clr ( t, 0x3f3f3f3f );
        clr ( num, 0 );
        t[0] = node ( 0, 0 );
        ans = 999999999;
        RDIII ( n, x, y );
        RDI ( _max );
        int a, b, c;
        REP ( i, 1, n ){
            RDIII ( a, b, c );
            num[i] = node ( a, b, c );
        }
        num[0] = node ( x, x, y );
        num[n+1] = node ( -20005, 20005, 0 );
        sort ( num, num + 2 + n );
        dfs ( 0, 0, 0 );
        PIL ( ans );
    }
    return 0;
}