题目大意:
给你一个
n
×
m
n\times m
n×m的矩阵问你可以截取出多少个不同的矩阵
然后每次会有一个点变成无效点
动态输出每次剩余可挖的矩阵是多少?
解题思路:
首先我们可以这么搞就是对于每个点我们维护它上面最近的无效点,然后暴力枚举包含当前即将变成无效点的矩阵有多少个暴力减掉就行了
具体实现就是
在固定了
x
x
x值之后,我们枚举矩阵左上角和右下角所在的y值就行了
直观上面复杂度是 O ( n 4 ) O(n^4) O(n4)的但是不是每个点最多被访问 n n n次,总的复杂度是 O ( n 3 ) O(n^3) O(n3)的。
AC code
#include <bits/stdc++.h>
#define mid ((l + r) >> 1)
#define Lson rt << 1, l , mid
#define Rson rt << 1|1, mid + 1, r
#define ms(a,al) memset(a,al,sizeof(a))
#define log2(a) log(a)/log(2)
#define lowbit(x) ((-x) & x)
#define IOS std::ios::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define INF 0x3f3f3f3f
#define LLF 0x3f3f3f3f3f3f3f3f
#define f first
#define s second
#define endl '\n'
using namespace std;
const int N = 2e6 + 10, mod = 1e9 + 9;
const int maxn = 500010;
const long double eps = 1e-5;
const int EPS = 500 * 500;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> PII;
typedef pair<ll,ll> PLL;
typedef pair<double,double> PDD;
template<typename T> void read(T &x) {
x = 0;char ch = getchar();ll f = 1;
while(!isdigit(ch)){if(ch == '-')f*=-1;ch=getchar();}
while(isdigit(ch)){x = x*10+ch-48;ch=getchar();}x*=f;
}
template<typename T, typename... Args> void read(T &first, Args& ... args) {
read(first);
read(args...);
}
int n, m;
int Down[505][505];
int Up[505][505];
bool vis[505][505];
int main() {
IOS;
cin >> n >> m;
for(int i = 1; i <= n; ++ i)
for(int j = 1; j <= m; ++ j)
Down[i][j] = n+1, Up[i][j] = 0;//(i,j)个点上面第一个不能的点,
ll ans = (1ll*n*(n+1))/2 * (1ll*m*(m+1))/2;
for(int i = 1,x,y; i <= n * m; ++ i) {
cin >> x >> y;
// 矩阵左端
for(int l = y, lupx = 1, ldownx = n; l >= 1 && !vis[x][l]; -- l) {
lupx = max(lupx,Up[x][l]+1);
ldownx = min(ldownx,Down[x][l]-1);
// 矩阵右端
for(int r = y, rupx = lupx, rdownx = ldownx; r <= m && !vis[x][r]; ++ r) {
rupx = max(rupx,Up[x][r]+1);
rdownx = min(rdownx,Down[x][r]-1);
ans -= 1ll*(rdownx-x+1) * (x-rupx+1); // 组合贡献
}
}
cout << ans << "\n";
// 更新答案
for(int j = x - 1; j >= 1 && !vis[j][y]; -- j) Down[j][y] = x;
for(int j = x + 1; j <= n && !vis[j][y]; ++ j) Up[j][y] = x;
vis[x][y] = 1;
}
return 0;
}
/*
____________________y
|
|
|
|
|
|
|
x
*/