长知识啦..二维BIT. #include<iostream> #include<cstdio> #include<cstring> #include<algorithm> using namespace std; int n,m,q,t[105][305][305],map[305][305]; int a,b,c,d,e,f; int lowbit(int x) { return x&(-x); } void update(int x,int y
http://www.lydsy.com/JudgeOnline/problem.php?id=1452 题意:n×m的矩阵上每个点有个颜色,现在有q个操作:1 x y c 将点(x,y)的颜色改为c:2 x1 x2 y1 y2 c 询问矩阵x1y1-x2y2颜色为c的格子数目 #include <bits/stdc++.h> using namespace std; const int N=301; int n, m; int S[101][N][N], col[N][N]; void up