#include<iostream>
#include<stdlib.h>
#include<stdio.h>
using namespace std;
#define ma(x,y) ((x>y?x:y))
int dp[11][100005],time[11][100005];
int main()
{
int n;
while(scanf("%d",&n)!=EOF&&n)
{
memset(dp,0,sizeof(dp));
memset(time,0,sizeof(time));
int maxt=0;
int id,t;
for(int i=0;i<n;i++)
{
scanf("%d%d",&id ,&t );
time[id][t]++;
maxt=ma(maxt,t );
}
int k,maxtt=-1;
for(int i=1;i<=maxt;i++)
{
for(k=0;k<=10;k++)
{
dp[k][i]=dp[k][i-1];
if(k>=1) dp[k][i]=ma(dp[k][i],dp[k-1][i-1]);
if(k<=9) dp[k][i]=ma(dp[k][i],dp[k+1][i-1]);
if(i>=abs(k-5))
dp[k][i]+=time[k][i];
}
}
for(int k=0;k<=10;k++)
maxtt=ma(dp[k][maxt],maxtt);
printf("%d\n",maxtt);
}
return 0;
}
hdu 1176免费馅饼 //dp
最新推荐文章于 2021-05-20 07:57:33 发布