HDU_1176_DP

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

简单dp，转换后跟上一题数塔一样，注意每秒只能移动一格，还有在边缘的情况。

#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;

int a[][];

int maxx(int x,int y,int z)
{
    int temp = max(x,y);
    return max(temp,z);
}

int main()
{
    int n;
    while(scanf("%d",&n) && n)
    {
        memset(a,,sizeof(a));
        int time = ;
        while(n--)
        {
            int t,x;
            scanf("%d%d",&x,&t);
            time = max(time,t);
            a[t][x]++;
        }
        for(int i = time-;i >= ;i--)
        {
            for(int j = ;j < ;j++)    a[i][j] += maxx(a[i+][j],a[i+][j-],a[i+][j+]);
            a[i][] += max(a[i+][],a[i+][]);
            a[i][] += max(a[i+][],a[i+][]);
        }
        printf("%d\n",a[][]);
    }
    return ;

}