先贴个题目:
以及原题链接: 99. 激光炸弹 - AcWing题库https://www.acwing.com/problem/content/101/
讲讲思路:x,y都是5000以内,而正常暴力枚举需要的复杂度为n的三次方,必定超时,所以只能用前缀和知识解决,上题的二位前缀和思想可以用到这题种中,但还是有一些我不太理解的地方,先看看我第一次写的错误代码:
#include <iostream>
#include <cstring>
#include <cmath>
using namespace std;
const int N = 5010;
int a[N][N];
int main()
{
int n, r;
cin >> n >> r;
int x, y, w;
int mx = 0, my = 0;
memset(a, 0, sizeof(a));
for (int i = 0; i < n; ++i)
{
scanf("%d%d%d", &x, &y, &w);
if (x + 1 > mx)
mx = x + 1;
if (y + 1 > my)
my = y + 1;
a[x + 1][y + 1] += w;
}
int m=(mx,my);
for (int i = 1; i < m; ++i)
for (int j = 1; j < m; ++j)
a[i][j] = (a[i - 1][j] - a[i - 1][j - 1] + a[i][j - 1] + a[i][j]);
int msum = 0, sum = 0;
if (r > 5000)
{
cout << a[mx][my];
return 0;
}
for (int i = r; i < m; ++i)
for (int j = r; j < m; ++j)
{
sum = a[i][j] - a[i - r][j] - a[i][j - r] + a[i - r][j - r];
if (sum > msum)
msum = sum;
}
cout << msum;
return 0;
}
可以看到我算出了一个最大有价值的边界mx,my然后取最大值,这样可以减少一些运算量,但对于一些xy比较大的样例就会出现错误,我也不知道为什么,希望有懂得可以教教我,我当时调整了很久不知道哪里有问题,最后把边界换成了N,然后就ac了,代码如下:
#include <iostream>
#include <cstring>
#include <cmath>
using namespace std;
const int N = 5010;
int a[N][N];
int main()
{
int n, r;
cin >> n >> r;
int x, y, w;
memset(a, 0, sizeof(a));
for (int i = 0; i < n; ++i)
{
scanf("%d%d%d", &x, &y, &w);
a[x + 1][y + 1] += w;
}
for (int i = 1; i < N; ++i)
for (int j = 1; j < N; ++j)
a[i][j] = (a[i - 1][j] - a[i - 1][j - 1] + a[i][j - 1] + a[i][j]);
int msum = 0, sum = 0;
if (r > 5000)
{
cout << a[N-1][N-1];
return 0;
}
for (int i = r; i < N; ++i)
for (int j = r; j < N; ++j)
{
sum = a[i][j] - a[i - r][j] - a[i][j - r] + a[i - r][j - r];
if (sum > msum)
msum = sum;
}
cout << msum;
return 0;
}
就这点卡了我三个小时,还是没想明白,望大佬们指教。
by————2024.2.3刷题记录