思路:dp[i][j]表示第i秒时,第j个位置获得馅饼的最大值,则dp[i][j] += max(dp[i-1][j],max(dp[i-1][j-1],dp[i-1][j+1])),另外由于起点是5,所以初始化时应该只留下这样的馅饼:abs(x-5) <= t,dp[t][x] ++;
#include<iostream>
#include<cstring>
#include<cstdlib>
#include<cstdio>
#define MAX 111111
using namespace std;
int dp[MAX][15];
int main(){
int n, x, t, maxt, ans;
while(~scanf("%d", &n) && n){
memset(dp, 0, sizeof(dp));
ans = maxt = - (1 << 30);
for(int i = 0;i < n;i ++){
scanf("%d%d", &x, &t);
if(abs(x-5) <= t) dp[t][x] ++;
maxt = max(maxt, t);
}
for(int i = 1;i <= maxt;i ++){
for(int j = 0;j <= 10;j ++){
if(j == 0) dp[i][j] += max(dp[i-1][j], dp[i-1][1]);
else if(j == 10) dp[i][j] += max(dp[i-1][j], dp[i-1][9]);
else dp[i][j] += max(dp[i-1][j], max(dp[i-1][j-1], dp[i-1][j+1]));
ans = max(ans, dp[i][j]);
}
}
printf("%d\n", ans);
}
}