fork download
  1. #include <bits/stdc++.h>
  2. #define ll long long
  3. #define pii pair<int, int>
  4. using namespace std;
  5. const int N = (int)1e3 + 5;
  6. const ll MOD = (int)100000;
  7. const ll cow = 10007;
  8. const ll INF = (ll)1e9 + 5;
  9.  
  10.  
  11. ll f[1030][1030];
  12. int n, d;
  13.  
  14. int main()
  15. {
  16. // freopen("RAT.inp","r",stdin);
  17. // freopen("RAT.out","w",stdout);
  18. ios_base::sync_with_stdio(false);
  19. cin.tie(0);
  20. int t;
  21. cin >> t;
  22. while(t--)
  23. {
  24. cin >> d;
  25. for(int i=1;i<=1025;i++)
  26. for(int j=1;j<=1025;j++)
  27. f[i][j] = 0;
  28.  
  29. cin >> n;
  30. for(int i=1;i<=n;i++)
  31. {
  32. int x, y, c;
  33. cin >> x >> y >> c;
  34. x++;
  35. y++;
  36. f[x][y] += c;
  37. }
  38. for(int i=1;i<=1025;i++)
  39. for(int j=1;j<=1025;j++)
  40. f[i][j] = f[i - 1][j] + f[i][j - 1] - f[i - 1][j - 1] + f[i][j];
  41. ll res = -INF;
  42. int resfi = 0, resse = 0;
  43. for(int i=1;i<=1025;i++)
  44. {
  45. for(int j=1;j<=1025;j++)
  46. {
  47. int u = min(1025, i + d);
  48. int v = min(j + d, 1025);
  49. int x = max(i - d - 1, 0);
  50. int y = max(j - d - 1, 0);
  51.  
  52. ll val = f[u][v] - f[x][v] - f[u][y] + f[x][y];
  53. if(val > res)
  54. {
  55. resfi = i;
  56. resse = j;
  57. res = val;
  58. }
  59. }
  60. }
  61. cout << resfi - 1 << ' ' << resse - 1 << ' ' << res << '\n';
  62. }
  63. }
  64.  
Success #stdin #stdout 0.02s 11912KB
stdin
Standard input is empty
stdout
0 0 0
0 0 0