Submission

Score: 30

User: Prap

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

Language: cpp

Time: 0.002 second

Submitted On: 2026-04-07 20:57:58

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