HDU1176 2018-2-1

int dp[11][100001];  
  
inline int Max(int a, int b, int c=-1)  
{  
    if(a < b) a = b;  
    if(a < c) a = c;  
    return a;  
}  
  
int main()  
{  
    int n, i, j;  
    int t, x;  
    while (scanf("%d", &n)!=EOF && n)  
    {  
        memset(dp, 0, sizeof(dp));  
        int MaxTime = 0;  
        for (i=0; i<n; ++i)  
        {  
            scanf("%d%d", &x, &t);  
            ++dp[x][t];  
            MaxTime = t>MaxTime ? t:MaxTime;  
        }  
        for (j=MaxTime-1; j>=0; --j)  
        {  
            dp[0][j] += Max(dp[0][j+1], dp[1][j+1]);  
            dp[10][j] += Max(dp[10][j+1], dp[9][j+1]);  
            for (i=1; i<10; ++i)  
            {  
                dp[i][j] += Max(dp[i][j+1], dp[i+1][j+1], dp[i-1][j+1]);  
            }  
        }  
        printf("%d/n", dp[5][0]);  
    }  
    return 0;  
}