#include <bits/stdc++.h>
using namespace std;
const int MAX_V = 100005;
int inp[MAX_V][11], dp[MAX_V][11], N, max_t;
void solve()
{
for (int i = max_t - 1; i >= 0; i--)
for (int j = 0; j <= 10; j++)
dp[i][j] = max(dp[i + 1][j] + inp[i + 1][j], max((!j ? 0 : dp[i + 1][j - 1] + inp[i + 1][j - 1]), (j - 10 == 0 ? 0 : dp[i + 1][j + 1] + inp[i + 1][j + 1])));
cout << dp[0][5] << endl;
}
int main(int argc, char const *argv[])
{
std::ios::sync_with_stdio(false);
std::cin.tie(0);
while (cin >> N && N)
{
memset(dp, 0, sizeof(dp));
memset(inp , 0, sizeof(inp));
int T, X;
while (N--)
{
cin >> X >> T;
inp[T][X]++;
max_t = max(max_t, T);
}
solve();
}
return 0;
}
这道题做过一遍了,自信写完,不对!蒙了,
她输入先x再t,simple中倒着写的,没注意
读题还是很关键啊啊