HDU-OJ 杭电 1176 免费馅饼

#include "stdio.h"
#include "cstring"
#include "algorithm"

using namespace std;

int dp[100005][20];
int data[100005][20];//前者代表天数，后者代表每点的个数

int main(){
int n;
int a, b;
int max_day = 0;

while(scanf("%d",&n) != EOF && n != 0){
memset(dp,0,sizeof(dp));
memset(data,0,sizeof(data));

for(int i = 0; i < n; i++){
scanf("%d%d",&a,&b);
data[b][a+1]++;
if(b > max_day) max_day = b;
}

for (int i = max_day - 1; i >= 0; i--){
for(int j = 1; j <= 11; j++)
dp[i][j] = max(dp[i+1][j],max(dp[i+1][j-1],dp[i+1][j+1])) + data[i][j];
}
printf("%d\n",dp[0][6]);
}
}