SDUT 走迷宫

#include <stdio.h>

#include <string.h>
int pie[100001][12];
int max2(int a, int b)
{
    if(a>b) return a;
    else return b;
}
int max3(int a, int b, int c)
{
    int max = a;
    if(b>max) max = b;
    if(c>max) max = c;
    return max;
}
int f(int maxtime)
{
    int i, j;
    for (i = maxtime-1; i >= 0; i--)
    {
        pie[i][0] = max2(pie[i+1][0], pie[i+1][1]) + pie[i][0];
        for (j = 1; j < 10; j++)
        {
            pie[i][j] = max3(pie[i+1][j-1], pie[i+1][j], pie[i+1][j+1]) + pie[i][j];
        }
        pie[i][10] = max2(pie[i+1][10], pie[i+1][9]) + pie[i][10];
    }
    return pie[0][5];
}
int main(void)
{
    int n, i, time, maxtime, location;
    while (scanf("%d", &n) != EOF && n)
    {
        memset(pie, 0, sizeof(pie));
        maxtime = -1;
        for (i=1; i<=n; i++)
        {
            scanf ("%d%d", &location, &time);
            pie[time][location]++;
            if (maxtime < time)
                maxtime = time;
        }
        printf ("%d\n", f(maxtime));
    }




    return 0;
}