\n\u505a\u6cd5\u7c7b\u4f3c\u67d0\u9898\u3002\u3002\u8fd9\u91cc\u5c31\u4e0d\u8d58\u8ff0\u4e86\u3002\u3002<\/p>\n
\u3002\u3002\u8003\u8651\u8be2\u95ee\u77e9\u9635\u7684 \u201c\u524d\u7f00\u548c\u201d $$! \\begin{aligned} Sum &=\\sum_{i=1}^{x}\\sum_{i=1}^{y} d_{ij}(x-i+1)(y-j+1) \\\\&= \\sum_{i=1}^{x}\\sum_{i=1}^{y} d_{ij}(x+1)(y+1) – d_{ij} i (y+1) – d_{ij} j (x+1) + d_{ij} i j \\end{aligned}$$<\/p>\n \u7528\u4e8c\u7ef4\u6811\u72b6\u6570\u7ec4\u5206\u522b\u7ef4\u62a4\u8fd9\u56db\u4e2a\u589e\u91cf\u5373\u53ef\u3002<\/p>\n[1, 1]-[x, y]<\/code>\u3002\u8bbe $$d_{ij}$$ \u662f [i, j] \u5bf9\u53f3\u4e0b\u89d2\u7684 [i, j]-[n, m]<\/code> \u8d21\u732e\uff0c\u5219\u6709\uff1a<\/p>\n\r\nconst int N = 2049;\r\n\r\nint S[N][N], Sx[N][N], Sy[N][N], Sxy[N][N];\r\nint n, m;\r\n\r\nvoid Add(int S[N][N], int x, int _y, int d){\r\n for (;x<=n;x+=low_bit(x))\r\n for (int y=_y;y<=m;y+=low_bit(y))\r\n S[x][y] += d;\r\n}\r\n\r\nint Sum(int S[N][N], int x, int _y){\r\n int z=0; for (;x;x^=low_bit(x))\r\n for (int y=_y;y;y^=low_bit(y))\r\n z += S[x][y];\r\n return z;\r\n}\r\n\r\nvoid Add(int x, int y, int d){\r\n Add(S, x, y, d), Add(Sx, x, y, x*d), Add(Sy, x, y, y*d), Add(Sxy, x, y, x*y*d);\r\n}\r\n\r\nint Sum(int x, int y){\r\n return Sum(S, x, y)*(x+1)*(y+1) - Sum(Sx, x, y)*(y+1) - Sum(Sy, x, y)*(x+1) + Sum(Sxy, x, y);\r\n}\r\n\r\nint Sum(int x0, int y0, int x1, int y1){\r\n return Sum(x1, y1) - Sum(x1, y0-1) - Sum(x0-1, y1) + Sum(x0-1, y0-1);\r\n}\r\n\r\nvoid Add(int x0, int y0, int x1, int y1, int d){\r\n Add(x0, y0, d), Add(x0, y1+1, -d), Add(x1+1, y0, -d), Add(x1+1, y1+1, d);\r\n}\r\n\r\n\r\nint main(){\r\n\r\n#ifndef ONLINE_JUDGE\r\n freopen("in.txt", "r", stdin);\r\n#endif\r\n\r\n scanf("%*c%d%d", &n, &m);\r\n\r\n char cmd; int x0, y0, x1, y1;\r\n\r\n while (~scanf(" %c", &cmd)){\r\n RD(x0, y0, x1, y1);\r\n if (cmd == 'L') Add(x0, y0, x1, y1, RDD());\r\n else OT(Sum(x0, y0, x1, y1));\r\n }\r\n}\r\n<\/pre>\n