Submission #1757988

---

Source Code Expand

#define  _CRT_SECURE_NO_WARNINGS
#include <stdio.h>
#include <algorithm>
#include <utility>
#include <functional>
#include <cstring>
#include <queue>
#include <stack>
#include <math.h>
#include <iterator>
#include <vector>
#include <string>
#include <set>
#include <math.h>
#include <iostream>
#include <random>
#include<map>
#include <iomanip>
#include <time.h>
#include <stdlib.h>
#include <list>
#include <typeinfo>
#include <list>
#include <set>
#include <cassert>
#include<fstream>
#include <unordered_map>
#include <cstdlib>
using namespace std;
#define Ma_PI 3.141592653589793
#define eps 0.00000001
#define LONG_INF 3000000000000000000
#define GOLD 1.61803398874989484820458
#define MAX_MOD 1000000007
#define REP(i,n) for(long long i = 0;i < n;++i)                                                                             
#define seg_size 524288
int main() {
	int n, m;
	cin >> n >> m;
	vector<string> s;
	string a;
	REP(i, m + 2) {
		a.push_back('X');
	}
	s.push_back(a);
	for (int i = 0;i < n;++i) {
		string b;
		cin >> b;
		s.push_back('X' + b + 'X');
	}
	s.push_back(a);
	long long ans = 0;
	for (int i = 0;i < n;++i) {
		for (int q = 0;q < m;++q) {
			long long tmp = 0;
			for (int j = 0;j >= 0;++j) {
				for (int t = 0;t <= j;++t) {
					if (s[i + j - t][q + t] == 'X') goto foo;
					tmp += s[i+j-t][q+t] - '0';
				}
				ans = max(ans, tmp);
			}
		foo:;
			tmp = 0;
			for (int j = 0;j >= 0;++j) {
				for (int t = 0;t <= j;++t) {
					if (s[i + t][q + j - t] == 'X') goto foo2;
					tmp += s[i + t][q + j-t] - '0';
				}
				ans = max(ans, tmp);
			}
		foo2:;
			tmp = 0;
			for (int j = 0;j >= 0;++j) {
				for (int t = 0;t <= j;++t) {
					if (s[i - t][q + j - t] == 'X') goto foo3;
					tmp += s[i - t][q + j - t] - '0';
				}
				ans = max(ans, tmp);
			}
		foo3:;
			tmp = 0;
			for (int j = 0;j >= 0;++j) {
				for (int t = 0;t <= j;++t) {
					if (s[i + j - t][q - t] == 'X') goto foo4;
					tmp += s[i + j - t][q - t] - '0';
				}
				ans = max(ans, tmp);
			}
		foo4:;
		}
	}
	cout << ans << endl;
	return 0;
}

Submission Info

Judge Result