sume partiale matrici

<code>for(int i = 1; i <= n; i++) for(int j = 1; j <= m; j++) S[i][j] = S[i-1][j] + S[i][j-1] – S[i-1][j-1] + M[i][j]; for(int x = 1; x <= k; x++) { int i1, j1, i2, j2; cin >> i1 >> j1 >> i2 >> j2;

int s = S[i2][j2] – S[i1-1][j2] – S[i2][j1-1] + S[i1-1][j1-1]; if(s > max) max = s; }</code>