[bzoj2901]矩阵求和

【[bzoj2901]矩阵求和】的更多相关文章

题目大意:给出两个$n\times n$的矩阵,$m$次询问它们的积中给定子矩阵的数值和. 题解:令为$P\times Q=R$ $$\begin{align*}&\sum\limits_{i=a}^c\sum\limits_{j=b}^dR[i][j]\\=&\sum\limits_{i=a}^c\sum\limits_{j=b}^d\sum\limits_{k=1}^nP[i][k]\cdot Q[k][j]\\=&\sum\limits_{k=1}^n(\sum\limits…

poj 1195:Mobile phones（二维树状数组，矩阵求和）

Mobile phones Time Limit: 5000MS Memory Limit: 65536K Total Submissions: 14489 Accepted: 6735 Description Suppose that the fourth generation mobile phone base stations in the Tampere area operate as follows. The area is divided into squares. The…

poj 1195:Mobile phones（二维线段树，矩阵求和）

Mobile phones Time Limit: 5000MS Memory Limit: 65536K Total Submissions: 14391 Accepted: 6685 Description Suppose that the fourth generation mobile phone base stations in the Tampere area operate as follows. The area is divided into squares. The…

UVA 11149-Power of Matrix（等比矩阵求和）

给定一个矩阵A 要求A + A^2 + A^3 +…. A^k: 对于到n的等比矩阵求和如果n是偶数: 如果n是奇数: #include<stdio.h> #include<string.h> #include<algorithm> using namespace std; ; ; int n, k; struct matrix { int mat[maxn][maxn]; }; matrix mat_add(matrix A, matrix B) { matri…