Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <fstream>
- using namespace std;
- int n,m, A[105][105];
- long long Q[105][105];
- long long query (int i1, int j1, int i2, int j2)
- {
- return Q[i2][j2] - Q[i1-1][j2] - Q[i2][j1-1] + Q[i1-1][j1-1];
- }
- void createMatrix()
- {
- for(int i = 1 ; i <= n ; i ++)
- for(int j = 1 ; j <= m ; j ++)
- Q[i][j] = Q[i-1][j] + Q[i][j-1] - Q[i-1][j-1] + A[i][j];
- }
- int main()
- {
- ifstream fin("zoo.in");
- ofstream fout("zoo.out");
- fin>>n>>m;
- for (int i=1; i<=n; i++)
- for (int j=1; j<=m; j++)
- fin>>A[i][j];
- createMatrix();
- int Q;
- fin>>Q;
- for (int i=1; i<=Q; i++)
- {
- int i1, i2, j1, j2;
- fin>>i1>>j1>>i2>>j2;
- fout<<query(i1,j1,i2,j2)<<endl;
- }
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement