hdoj 1176 免费馅饼

//---	Accepted ---	1176	78MS	4900K	---	G++	---
#include<cstdio>
#include<string>
using namespace std;

int dp[12][100001];

int max(const int& t1, const int& t2, int t3 = 0)
{
int t = (t1 > t2) ? t1 : t2;
return (t > t3) ? t : t3;
}

int main()
{
int N, x , T, maxT;
//freopen("in.txt", "r", stdin);
while(scanf("%d", &N)==1 && N)
{
maxT = 0;
memset(dp, 0, sizeof(dp));
for(int i = 0; i < N; ++i)
{
scanf("%d %d", &x, &T);
++dp[x][T];
if(maxT < T)
{
maxT = T;
}
}

for(int i = maxT-1; i >= 1; --i)
{
for(int j = 10; j >= 0; --j)
{
if(j == 10)
{
dp[j][i] += max(dp[j][i+1], dp[j-1][i+1]);
}
else if(j == 0)
{
dp[j][i] += max(dp[j][i+1], dp[j+1][i+1]);
}
else
{
dp[j][i] += max(dp[j][i+1], dp[j+1][i+1], dp[j-1][i+1]);
}
}
}

printf("%d\n", max(dp[4][1], dp[5][1], dp[6][1]));
}
return 0;
}