P3397 地毯（二维差分）

题目描述

分析

dalao的分析：链接

代码

#include<iostream>
#include<stdlib.h>
#include<string>
//#include<math.h>
#include<algorithm>
#include<vector>
#include<cstdio>
using namespace std;
int n,m,x1,x2,y1,y2,sum;
int a[1005][1005],ans[1005][1005]; 
int main(){
	//freopen("a.txt","r",stdin);
	cin>>n>>m;
	for(int i = 0;i<m;i++){
		cin>>x1>>y1>>x2>>y2;
		int minx = min(x1,x2),miny = min(y1,y2);
		int maxx = max(x1,x2),maxy = max(y1,y2);
		for(int x = minx;x <= maxx;x++){
			a[x][miny] += 1;
			a[x][maxy+1] -= 1;
		}
	}
	for(int i = 1;i<=n+1;i++){
		sum = 0;
		for(int j = 1;j <= n+1;j++){
			sum += a[i][j];
			ans[i][j] = sum;
		}
	}
	for(int i = 1;i<=n;i++){
		for(int j = 1;j <= n;j++){
			cout<<ans[i][j]<<' ';
		}
		cout<<endl;
	}
	return 0;
}