Submission

Score: 0

User: Prap

Problemset: สูงต่ำในตาราง

Language: cpp

Time: 0.002 second

Submitted On: 2026-04-07 20:48:06

#include <iostream>
#include <cmath>
#include <string>
#include <vector>
using namespace std;
int main() {
	int N,B;
	cin>>N>>B;
	int nig[N][N];
	int count = 0;
	int maxid[2] = {1};
	int minid[2] = {1};
	for (int i = 0; i<N; i++) {
		for (int j = 0; j<N; j++) {
			cin>>nig[i][j];
			if (nig[i][j] > nig[maxid[0]-1][maxid[1]-1]) {
				maxid[0] = i+1;
				maxid[1] = j+1;
			}
			if (nig[i][j] < nig[minid[0]-1][minid[1]-1]) {
				minid[0] = i+1;
				minid[1] = j+1;
			}
		}
	}
	//cout<<maxid[0]<<" "<<maxid[1]<<endl<<minid[0]<<" "<<minid[1]<<endl;
	if (maxid[0] != minid[0]) {
		cout<<nig[maxid[0]-1][maxid[1]-1] - nig[minid[0]-1][minid[1]-1] + 2*B;
	}
	else {
		cout<<nig[maxid[0]-1][maxid[1]-1] - nig[minid[0]-1][minid[1]-1];
	}
}