hdu 1176

#include<stdio.h>
#include<string.h>
int dp[15][100005];
int max(int x,int y)
{
	return x>y ? x:y;
}
int main()
{
    int n,x,y,i,j,time;
    while(scanf("%d",&n),n!=0)
    {
        memset(dp,0,sizeof(dp));
        time=0;
        for(i=1;i<=n;i++)
        {
            scanf("%d%d",&x,&y);
            dp[x][y]++;
            if(y>time)
                time=y;
        }
        for(j=time-1;j>=0;j--)
            for(i=0;i<=10;i++)
            {
                if(i==0)
                    dp[i][j]+=max(dp[i+1][j+1],dp[i][j+1]);
                else if(i==10)
                    dp[i][j]+=max(dp[i-1][j+1],dp[i][j+1]);
                else
                    dp[i][j]+=max(dp[i-1][j+1],max(dp[i][j+1],dp[i+1][j+1]));
            }
        printf("%d\n",dp[5][0]);
    }
    return 0;
}


#include <iostream>  
#include <string.h>  
using namespace std;  
const int maxTime = 100002, maxShift = 13;  
int n;  
int maxSum, maxCircleTime;  
int pie[maxTime][maxShift], dp[maxTime][maxShift];  
int max(int a, int b)
{
	return a>b ? a:b;
}
void numberTower()  
{  
        int i, j, k;  
        for( i = maxCircleTime; i >= 0; i-- )  
                for( j = 1; j < 12; j++ )  
                {  
                        dp[i][j] = max( dp[i+1][j-1], max( dp[i+1][j], dp[i+1][j+1] ) ) + pie[i][j];  
                }  
        maxSum = dp[0][6];  
}  
  
int main()  
{  
        int i, j, k, point, t;  
        while( cin >> n && n )  
        {  
                memset( pie, 0, sizeof( pie ) );  
                memset( dp, 0, sizeof( dp ) );    
                maxCircleTime = 0;  
                for( i = 1; i <= n; i++ )  
                {  
                        cin >> point >> t;  
                        if( maxCircleTime < t )  
                                maxCircleTime = t;    
                        ++pie[t][point + 1];  
                }  
                numberTower();  
                cout << maxSum << endl;  
        }  
}  



#include<stdio.h>
#include<string.h>
int a[100005][13],d[100005][13];
int maxt,maxsum;
int max(int c,int b)
{
	if(c<b)
		return b;
	else 
		return c;
}
void f()
{
	int i,j;
	for(i=maxt;i>=0;i--)
	{
		for(j=1;j<12;j++)
			a[i][j]=max(a[i+1][j-1],max(a[i+1][j],a[i+1][j+1]))+d[i][j];
	}
  maxsum=a[0][6];
}
int main()
{
	int n,i,x,t;
	while(scanf("%d",&n),n!=0)
	{
		maxt=0;
		memset(a,0,sizeof(a));
		memset(d,0,sizeof(d));
		for(i=1;i<=n;i++)
		{
			scanf("%d%d",&x,&t);
			{
				if(maxt<t)
					maxt=t;
				d[t][x+1]++;
			}
		}
		f();
		printf("%d\n",maxsum);
	}
	return 0;
}