백준 알고리즘 15724번 : 주지수

링크

https://www.acmicpc.net/problem/15724

sol1)

#pragma GCC optimize("O3")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#include<bits/stdc++.h>
#define X first
#define Y second
#define pb push_back
#define fastio cin.tie(0)->sync_with_stdio(0)
#define sz(v) (int)(v).size()
#define all(v) v.begin(), v.end()
#define rall(v) (v).rbegin(), (v).rend()
#define compress(v) sort(all(v)), (v).erase(unique(all(v)), (v).end())
#define OOB(x, y) ((x) < 0 || (x) >= n || (y) < 0 || (y) >= m)
#define debug(x) cout << (#x) << ": " << (x) << '\n'
using namespace std;
using ll = long long;
using ull = unsigned long long;
using dbl = double;
using ldb = long double;
using pii = pair<int,int>;
using pll = pair<ll,ll>;
using vi = vector<int>;
using vs = vector<string>;
using tii = tuple<int,int,int>;
template<typename T> using wector = vector<vector<T>>;

const int MOD = 1e9 + 7;
const int INF = 1e9 + 7;
const ll LNF = 1e18 + 7;

int pSum[1025][1025];

int main() {
  fastio;
  int n,m,q; cin >> n >> m;
  for(int i = 1; i <= n; i++){
    for(int j = 1; j <= m; j++){
      int t; cin >> t;
      pSum[i][j] = pSum[i - 1][j] + pSum[i][j - 1] - pSum[i - 1][j - 1] + t;
    }
  }
  cin >> q;
  while(q--){
    int x1,y1,x2,y2; cin >> x1 >> y1 >> x2 >> y2; --x1,--y1;
    cout << (pSum[x2][y2] - pSum[x1][y2] - pSum[x2][y1] + pSum[x1][y1]) << "\n";
  }
  return 0;
}

구간합 구하기 5와 같은 문제입니다.