Nyoj 613 免费馅饼

#include <stdio.h>
#include <string.h>

#define MAXN 100010




int MAX(int a, int b, int c)
{
    return ((a > b ? a : b) > c ? (a > b ? a : b) : c);
}

int main()
{
    int dp[MAXN][13];
    int n;
    int T, locate;
    int m;
    while(~scanf("%d", &n) && n)
    {
        m = 0;
        memset(dp, 0, sizeof(dp));
        for(int i = 0; i < n; ++i)
        {
            scanf("%d %d", &locate, &T);
            dp[T][locate+1]++;
            m = T > m ? T : m;
        }

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