Submission #61095

---

Source Code Expand

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

using namespace std;

int calc(const vector<string>& cake,
         int x, int y, int dx, int dy)
{
    int ans = 0, now = 0;
    for (int j = 0; ; j++) {
        for (int i = 0; i <= j; i++) {
            char c = cake[y + dy * j][x + dx * i];
            if (c == 'X') return ans;
            now += static_cast<int>(c - '0');
        }
        ans = now;
    }
}

int main()
{
    int n, m;
    cin >> n >> m;

    vector<string> cake;

    cake.push_back(string(m + 2, 'X'));
    for (int i = 0; i < n; i++) {
        string line;
        cin >> line;
        cake.push_back("X" + line + "X");
    }
    cake.push_back(string(m + 2, 'X'));

    int ans = 0;
    for (int y = 1; y <= n; y++) {
        for (int x = 1; x <= m; x++) {
            ans = max(ans, calc(cake, x, y, -1, -1));
            ans = max(ans, calc(cake, x, y, +1, -1));
            ans = max(ans, calc(cake, x, y, -1, +1));
            ans = max(ans, calc(cake, x, y, +1, +1));
        }
    }

    cout << ans << endl;
    return 0;
}

Submission Info

Judge Result