AcWing 2118. 打鼹鼠
原题链接
困难
作者:
hayate
,
2024-04-07 20:33:19
,
所有人可见
,
阅读 4
#include <iostream>
#include <cstring>
#include <algorithm>
using namespace std;
const int N = 10010;
struct Node
{
int x, y, t;
}w[N * 3];
int n, m;
int f[N];
int dist(int x1, int y1, int x2, int y2)
{
return abs(x1 - x2) + abs(y1 - y2);
}
int main()
{
cin >> n >> m;
for(int i = 1; i <= m; i ++ )
{
cin >> w[i].t >> w[i].x >> w[i].y;
}
for(int i = 1; i <= m; i ++ )
{
f[i] = 1;
for(int j = 1; j < i; j ++ )
{
if(dist(w[i].x, w[i].y, w[j].x, w[j].y) <= (w[i].t - w[j].t))
{
f[i] = max(f[i], f[j] + 1);
}
}
}
int res = 0;
for(int i = 1; i <= m; i ++ )
{
res = max(res, f[i]);
}
cout << res << endl;
return 0;
}