-
Notifications
You must be signed in to change notification settings - Fork 0
/
hdoj1176.cpp
38 lines (34 loc) · 904 Bytes
/
hdoj1176.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
#include<cstdio>
#include<cmath>
#include<iostream>
#include<algorithm>
#include<cstring>
#include<cstdlib>
#include<queue>
using namespace std;
int dp[100005][15];
int main(void) {
int time, pos;
int n;
while (scanf("%d", &n) == 1 && n) {
memset(dp, 0, sizeof(dp));
int end_Time = 0;
for (int i = 1; i <= n; i++) {
scanf("%d %d", &pos, &time);
dp[time][pos]++;
if (time > end_Time) {
end_Time = time;
}
}
for (int i = end_Time - 1; i >= 0; i--) {
dp[i][0] += max(dp[i + 1][1], dp[i + 1][0]);
for (int j = 1; j <= 10; j++) {
dp[i][j] += max(dp[i + 1][j],
max(dp[i + 1][j + 1],
dp[i + 1][j - 1]));
}
}
printf("%d\n", dp[0][5]);
}
return 0;
}