HDOJ 1176 免费馅饼

题意：一个人在坐标5为起点，每秒最多能移动1个单位距离，并且已知在某些时刻某些坐标会掉落一些馅饼，判断这个人最多能接到多少馅饼

链接：http://acm.hdu.edu.cn/showproblem.php?pid=1176

思路：简单的dp，dp[x][y],x表示时间，y表示坐标位置，状态转移方程：dp[x][y] = max ( dp[i][j-1], dp[i-1][j-1], dp[i+1][j-1] ) + dp[i][j]

注意点：dp[i][j]在读入数据时表示x时y点有打dp[x][y]个馅饼掉落

以下为AC代码：

Run ID	Submit Time	Judge Status	Pro.ID	Exe.Time	Exe.Memory	Code Len.	Language	Author
11359692	2014-08-07 19:17:08	Accepted	1176	93MS	6248K	1091 B	G++	luminous11

#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 x, y, cnt;
    node(){}
    node( int _x, int _y ) : x(_x), y(_y) {}
    node( int _x, int _y, int _cnt ) : x(_x), y(_y), cnt(_cnt) {}
};
int dp[100005][15];
int main()
{
    int n;
    int a, b;
    while ( RDI ( n ) != EOF && n ){
        clr ( dp, 0 );
        rep ( i, 0, n ){
            RDII ( a, b );
            if ( abs(  a - 5 ) <= b )
                dp[b][a] ++;
        }
        int ans = 0;
        rep ( i, 1, 100001 ){
            REP ( j, 0, 10 ){
                if ( j == 0 ){
                    dp[i][j] = max ( dp[i-1][j], dp[i-1][j+1] ) + dp[i][j];
                }
                else{
                    dp[i][j] = max ( dp[i-1][j], max ( dp[i-1][j-1], dp[i-1][j+1] ) ) + dp[i][j];
                }
                ans = max ( ans, dp[i][j] );
            }
        }
        PIL ( ans );
    }
    return 0;
}