1 条题解

  • 1
    @ 2024-7-25 13:21:25

    #include<iostream>
    
    using namespace std;
    
    const int N = 1010;
    int s[N][N], a[N][N];
    int n, m, q;
    
    int main()
    {
        cin >> n >> m >> q;
    
        for (int i = 1; i <= n; ++i)
            for (int j = 1; j <= m; ++j)
              scanf("%d", &a[i][j]);
    
         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] + a[i][j];
      
        while (q--)
        {
            int x1, y1, x2, y2;
            scanf("%d%d%d%d", &x1, &y1, &x2, &y2);
            printf("%d\n", s[x2][y2] - s[x1 - 1][y2] - s[x2][y1 - 1] + s[x1 - 1][y1 - 1]);
        }
    
        return 0;
    }
    
    • 1

    信息

    ID
    69
    时间
    1000ms
    内存
    256MiB
    难度
    8
    标签
    递交数
    21
    已通过
    4
    上传者