Submission #171727

---

Source Code Expand

#include <iostream>
#include <cstdlib>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <stack>
#include <queue>
#include <cctype>
#include <complex>
#include <vector>
#include <set>
#include <map>
#include <algorithm>
#include <functional>
#include <cassert>
#include <iomanip>

using namespace std;

#define pb push_back
#define all(x) (x).begin(),(x).end()
#define rall(x) (x).rbegin(),(x).rend()
typedef long long ll;
typedef complex<int> P;
typedef pair<int,int> pii;
const double EPS = 1e-10;
const double PI  = acos(-1.0);
template <class F, class T> void convert(const F &f, T &t){	stringstream ss; ss << f; ss >> t;}


bool solve(){
	int r, c, d;
	cin>> r>> c>> d;
	vector<vector<int> > a(r, vector<int>(c));
	for(int i=0;i<r;i++){
		for(int j=0;j<c;j++){
			cin>> a[i][j];
		}
	}
	
	int ans = 0;
	for(int i=0;i<=d && i<r;i++){
		for(int j=0;j<=d && j<c;j++){
			int ij = i+j;
			if(ij > d) break;
			if(ij%2 != d%2) continue;
			ans = max(ans, a[i][j]);
		}
	}
	
	cout<< ans<< endl;
	return true;
}

int main(){
	cout.setf(ios::fixed); cout.precision(10);
	solve();
	return 0;
}

 

Submission Info

Judge Result