提出 #60321

---

ソースコード 拡げる

// include {{{
#include <cstdio>
#include <iostream>
//#include <sstream>
#include <string>
#include <vector>
//#include <deque>
#include <stack>
#include <queue>
//#include <map>
#include <set>
#include <algorithm>
#include <cmath>
#include <numeric>
//#include <complex>
// }}}
using namespace std;
// macro {{{
typedef long long ll;
typedef vector<int> vec;
typedef vector<vec> mat;
typedef pair<int,int> P;
#define rep(i,n) for(int i=0;i<(n);++i)
#define REP(i,j,k) for(int i=j;i<(k);++i)
//#define foreach(it,v) for(__typeof((v).begin()) it=(v).begin();it!=(v).end();++it)
#define all(c) (c).begin(),(c).end()
#define rall(c) (c).rbegin(),(c).rend()
#define priority_queue_greater(T) priority_queue< T, vector<T>, greater<T> >
#define F first
#define S second
//test define...
#define D(x) #x<<"="<<(x)
#define CC <<" "<<
#define CE <<endl;
// }}}

const int dy[4] = { -1, -1, 1, 1 };
const int dx[4] = { -1, 1, -1, 1 };
int h,w;
int main(){
  while( cin >> h >> w ){
    vector<string> cake(h);
    rep(i,h){ cin >> cake[i]; }

    int ans = 0;
    rep(y,h)rep(x,w)rep(i,4){
      if( cake[y][x] == 'X' ){ break; }
      int now = cake[y][x] - '0', tmp;
      int yy = y, len = 0;
      while(true){
        yy += dy[i];
        if( yy < 0 || yy >= h ){ break; }
        int xx = x;
        tmp = 0;
        len++;
        bool success = true;
        rep(j,len+1){
          if( xx < 0 || w <= xx || cake[yy][xx] == 'X' ){ success = false; break; }
          //cout <<"  "<< yy <<" "<< xx <<" "<< cake[yy][xx] << endl;
          tmp += cake[yy][xx] - '0';
          xx += dx[i];
        }
        if( !success ){ break; }
        now += tmp;
      }
      //if( ans < now ){
        //cout << y <<" "<< x <<" "<< i <<" "<< now << endl;
      //}
      ans = max( ans, now );
    }
    cout << ans << endl;
  }
  return 0;
}


/*
   cake cell 900
   900 * 450 * 4
*/

提出情報

ジャッジ結果