#include<iostream> #include<stdio.h> #include<string.h> #include<stdlib.h> using namespace std; int map[100001][11]={0}; int main() { int n,case_point,time,i,j; //printf("%d",map[100][10]); while(scanf("%d",&n),n) { memset(map,0,sizeof(map)); int max_time=0; for(i=1;i<=n;i++) { scanf("%d%d",&case_point,&time); map[time][case_point]++; if(time>max_time) { max_time=time; } } int zero; //scanf("%d",&zero); for(i=max_time-1;i>=1;i--) { for(j=1;j<10;j++) { map[i][j]+=max(map[i+1][j-1],max(map[i+1][j],map[i+1][j+1])); } map[i][0]+=max(map[i+1][0],map[i+1][1]); map[i][10]+=max(map[i+1][10],map[i+1][9]); } printf("%d\n",max(map[1][4],max(map[1][5],map[1][6]))); } system("pause"); return 0; }
免费馅饼
最新推荐文章于 2018-08-20 09:23:47 发布