1088.cpp

POJ上的1088题的详细解答

#include <iostream>
using namespace std;
int main()
{
	int r;
	int i;
	int a;
	int b;
	int c;
	int j;
	int n;
	int up;
	int down;
	int left;
	int right;
	int max = 0;
	int min;
	int step[50][50][4];
	int num[50][50];
	cin>>r>>c;
	for(i = 0; i < r; ++i){
		for(j = 0; j < c; ++j){
			cin>>num[i][j];
		}
	}
	for(i = 0; i < r; ++i){
		for(j = 0; j < c; ++j){
			up = i - 1;
			down = i + 1;
			left = j - 1;
			right = j + 1;
			if(up < 0 ){
				step[i][j][0] = 0;
			}
			else{
				step[i][j][0] = num[i][j] - num[up][j];
				if(step[i][j][0] < 0 ){
					step[i][j][0] = 0;
				}
			}
			if(down == r){
				step[i][j][1] = 0;
			}
			else{
				step[i][j][1] = num[i][j] - num[down][j];
				if(step[i][j][1] < 0 ){
					step[i][j][1] = 0;
				}
			}
			if(left < 0){
				step[i][j][2] = 0;
			}
			else{
				step[i][j][2] = num[i][j] - num[i][left];
				if(step[i][j][2] < 0 ){
					step[i][j][2] = 0;
				}
			}
			if(right == c){
				step[i][j][3] = 0;
			}
			else{
				step[i][j][3] = num[i][j] - num[i][right];
				if(step[i][j][3] < 0 ){
					step[i][j][3] = 0;
				}
			}
		/*	else if(down == r){
				step[i][j][1] = 0;
			}
			else if(left < 0){
				step[i][j][2] = 0;
			}
			else if(right == c){
				step[i][j][3] = 0;
			}
			else {
				step[i][j][0] = num[i][j] - num[up][j];
				if(step[i][j][0] < 0 ){
					step[i][j][0] = 0;
				}
				step[i][j][1] = num[i][j] - num[down][j];
				if(step[i][j][1] < 0 ){
					step[i][j][1] = 0;
				}
				step[i][j][2] = num[i][j] - num[i][left];
				if(step[i][j][2] < 0 ){
					step[i][j][2] = 0;
				}
				step[i][j][3] = num[i][j] - num[i][right];
				if(step[i][j][3] < 0 ){
					step[i][j][3] = 0;
				}
			}*/
			for(a = 0; a < 4; ++a){
				cout<<step[i][j][i];
			}
			cout<<endl;	
		}
	}
	for(i = 0; i < r; ++i){
		for(j = 0; j < c; ++j){
			if(num[i][j] > max){
				a = i;
				b = j;
				max = num[i][j];
			}
		}
	}
	n = 1;
	while(1){
		if(step[a][b][0] == 0 && step[a][b][1] == 0 && step[a][b][2] == 0 && step[a][b][3] == 0){
			break;
		}
		min  = 65535;
		for(i = 0; i < 4; ++i){
			if(step[a][b][i] != 0 && step[a][b][i] < min ){
				c = i;
				min = step[a][b][i];
			}
		}
		cout<<a<<" "<<b<<" "<<num[a][b]<<" "<<n++<<endl;
		if(c = 0){
			a--;
			n++;
		}
		else if(c = 1){
			a++;
			n++;
		}
		else if(c = 2){
			b--;
			n++;
		}
		else if(c = 3){
			b++;
			n++;
		}
	}
	cout<<n<<endl;
	return 0;
}