暑期dp46道(33)--HDOJ 1176 免费馅饼 类树塔:

题目链接：HDOJ 1176

树塔问题，data[i][j]表示i时刻，j+1位置能接到最大馅饼数；

代码：

#include<cstdio>#include<cstring>#include<string>#define debug 0#define M(a) memset(a,0,sizeof(a))#define Max(a,b) ((a>b)?a:b)const int maxn = 100000 + 5;int data[maxn][15];int n, total;void Do(){for (int i = total - 1; i >= 0; i--){for (int j = 1; j <= 11; j++)data[i][j] += Max(data[i + 1][j], Max(data[i + 1][j - 1], data[i + 1][j + 1]));}printf("%d\n", data[0][6]);}int main(){#if debugfreopen("in.txt", "r", stdin);#endif//debugint pos, time;while (~scanf("%d", &n) && n){total = 0;M(data);for (int i = 1; i <= n; i++){scanf("%d%d", &pos, &time);total = Max(total, time);//printf("%d\n",total);data[time][pos + 1]++;}Do();}return 0;}