Submission #1604195

---

Source Code Expand

#include <iostream>
#include <algorithm>
#include <vector>

using namespace std;

int CalcTotal(vector<vector<int>> &source, int x, int y, int rangex, int rangey)
{
    int total = 0;
    for(int i = 0; i < rangex; i++)
    {
        for(int j = 0; j< rangey; j++)
        {
            total += source[x + i][y + j];
        }
    }
    return total;
}
void d()
{
    int n;
    cin >> n;
    vector<vector<int>> d(n);
    for(int i = 0; i < n; i++)
    {
        for(int j = 0; j < n; j++)
        {
            int temp;
            cin >> temp;
            d[i].push_back(temp);
        }
    }
    int q;
    cin >> q;
    vector<int> p(q);
    for(int i = 0; i < q; i++)
    {
        cin >> p[i];
    }
    int result[251] = {0};
    for(int i = 1; i <= n * n; i++)
    {
        vector<pair<int, int>> can;
        for(int j = 1; j <= n; j++)
        {
            for(int k = 1; k <= n; k++)
            {
                if(i == j * k)
                {
                    can.push_back(make_pair(j, k));
                }
            }
        }
        int maxv = 0;
        for(auto e : can)
        {
            for(int x = 0; x <= n - e.first; x++)
            {
                for(int y = 0; y <= n - e.second; y++)
                {
                    int tempv = CalcTotal(d, x, y, e.first, e.second);
                    maxv = maxv < tempv ? tempv : maxv;
                }
            }
        }
        if(result[i - 1] > maxv)
        {
            result[i] = result[i -1];
        }else{
            result[i] = maxv;
        }
    }
    /*for(int i = 0; i <=9; i++)
    {
        cout << result[i] << endl;
    }*/
    for(auto e : p)
    {
        cout << result[e] << endl;
    }
    /*for(int i = 0; i < q; i++)
    {
        vector<pair<int, int>> can;
        for(int j = 1; j <= n; j++)
        {
            for(int k = 1; k <= n; k++)
            {
                if(p[i] == j * k)
                {
                    can.push_back(make_pair(j, k));
                }
            }
        }
        int maxv = 0;
        for(auto e : can)
        {
            for(int x = 0; x <= n - e.first; x++)
            {
                for(int y = 0; y <= n - e.second; y++)
                {
                    int tempv = CalcTotal(d, x, y, e.first, e.second);
                    maxv = maxv < tempv ? tempv : maxv;
                }
            }
        }
        if(p[i] > n)
        {
           int range = p[i] / n;
            for(int x = 0; x <= n -range; x++)
            {
                int tempv = CalcTotal(d, x, 0, range, n);
                maxv = maxv < tempv ? tempv : maxv;
            }
            for(int y = 0; y <= n -range; y++)
            {
                int tempv = CalcTotal(d, 0, y, n, range);
                maxv = maxv < tempv ? tempv : maxv;
            }
        }
        cout << maxv << endl;
    }*/
}

int main() {
    d();
    return 0;
}

Submission Info

Judge Result