UVALive - 6889[並查集+STL]

題目鏈接:https://vjudge.net/contest/301219#problem/F

 

解題思路:

枚舉每個矩形的時候，看它是否需要和其他人合併只需要查看它的外形邊框是否又被標記，這個可以直接用離散化，然後set存一下每個矩形四個格子，就可以用log(n)找到合併的矩形，然後後並查集並一下就好了。

#include <bits/stdc++.h>
#define fi first
#define se second
using namespace std;
typedef long long ll;
typedef pair <int,int> pa;
const int mx = 1e5 + 10;
int n,m,num[mx],a[mx],b[mx]; 
map<int,set<pa>> r,c; 
int fa[mx];
ll sum[mx];
struct node
{
	int x1,y1;
	int x2,y2;
}s[mx];
int find(int x){
	return x==fa[x]? x:fa[x]=find(fa[x]); 
}
void merge(int x,set<pa>& st,int l,int r)
{
	auto it = st.lower_bound(pa(l,0));
	x = find(x);
	while(it!=st.end()&&(it->fi)<=r)
	{
		l = find(it->se);
		if(l!=x) sum[x] += sum[l],fa[l] = x; 
		it++;
	}
}
int main()
{
	while(~scanf("%d",&n)){
		int cx = 0,cy = 0;
		r.clear(),c.clear();
		for(int i=1;i<=n;i++){
			scanf("%d%d%d%d",&s[i].x1,&s[i].y1,&s[i].x2,&s[i].y2);
			sum[i] = s[i].x2*s[i].y2;
			s[i].x2 += s[i].x1 - 1;
			s[i].y2 += s[i].y1 - 1;
			fa[i] = i;
		}
		for(int i=1;i<=n;i++){
			int x1 = s[i].x1;
			int x2 = s[i].x2;
			int y1 = s[i].y1;
			int y2 = s[i].y2;
			r[x1].insert(pa(y1,i));r[x1].insert(pa(y2,i));
			r[x2].insert(pa(y1,i));r[x2].insert(pa(y2,i));
			c[y1].insert(pa(x1,i));c[y1].insert(pa(x2,i));
			c[y2].insert(pa(x1,i));c[y2].insert(pa(x2,i));
		}
		for(int i=1;i<=n;i++){
			if(r.count(s[i].x1-1)) 
			merge(i,r[s[i].x1-1],s[i].y1-1,s[i].y2+1);
			if(r.count(s[i].x2+1)) 
			merge(i,r[s[i].x2+1],s[i].y1-1,s[i].y2+1);
			if(c.count(s[i].y1-1)) 
			merge(i,c[s[i].y1-1],s[i].x1-1,s[i].x2+1);
			if(c.count(s[i].y2+1)) 
			merge(i,c[s[i].y2+1],s[i].x1-1,s[i].x2+1);
		}
		ll ans = 0;
		for(int i=1;i<=n;i++) if(find(i)==i)
		ans = max(ans,sum[i]);
		printf("%d\n",ans);
	}
    return 0;
}