Submission #1225216

---

Source Code Expand

#include<cstdio>
#include <iostream>
#include<algorithm>
#include<string>
#include<queue>
#include<vector>
#include<functional>
#include<cmath>
#include<map>
#include<stack>
#include<set>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;

int R, C, D;
int ans,k;

int main()
{
	cin >> R >> C >> D;
	int d = D % 2;
	for (int i = 0; i < R; i++) {
		for (int j = 0; j < C; j++) {
			cin >> k;
			if ((i + j <= D) && ((i + j) % 2 == d))
				ans = max(ans, k);
		}
	}
	cout << ans << endl;
	return 0;
}

Submission Info

Judge Result