提出詳細
ソースコード
#include <iostream>
#include <cstring>
#include <cstdlib>
#include <cmath>
#include <algorithm>
#include <functional>
#include <vector>
#include <list>
#include <queue>
#include <deque>
#include <stack>
#include <map>
#include <set>
#include <bitset>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll,ll> P;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<char> vc;
typedef vector<string> vs;
typedef vector<P> vp;
#define rep(i,a,n) for(ll i = (a);i < (n);i++)
#define per(i,a,n) for(ll i = (a);i > (n);i--)
#define lep(i,a,n) for(ll i = (a);i <= (n);i++)
#define pel(i,a,n) for(ll i = (a);i >= (n);i--)
#define clr(a,b) memset((a),(b),sizeof(a))
#define pb push_back
#define all(c) (c).begin(),(c).end()
#define sz size()
#define endl "\n"
#define print(X) cout << (X) << "\n"
// #define input(X) getline(cin,X)
static const int INF = 1e+9+7;
static const ll INFL = 1e+18+7;
ll n,m,l;
string s,t;
ll d[200010],dp[1001][1001];
int field[200][200];
void init(){
rep(i,0,200)rep(j,0,200)field[i][j] = -1;
}
void input(){
cin >> n >> m;
rep(i,10,10+m){
rep(j,10,10+n){
cin >> field[i][j];
}
}
}
int dfs(int x, int y){
int ans = 0;
int p[4] = {0,0,0,0};
rep(i,0,4){
p[0] += field[x+i][y];
p[1] += field[x][y+i];
p[2] += field[x+i][y+i];
p[3] += field[x-i][y+i];
}
ans = max(ans,max(max(p[0],p[1]),max(p[2],p[3])));
return ans;
}
int main(){
int p;
cin >> p;
rep(q,0,p){
int ans = 0;
init();
input();
rep(i,10-4,120){
rep(j,10-4,120){
ans = max(ans, dfs(i,j));
}
}
printf("Case #%lld:\n",q+1);
print(ans);
}
return 0;
}
提出情報
提出出力結果
テストケース情報