1068 万绿丛中一点红 (20 分)

#include<stdio.h>

#include<iostream>

#include<map>

using namespace std;

int main()

{

    int pic[1010][1010];

    int m, n, tol;

map<int,int>tpic;

    scanf("%d%d%d", &m, &n, &tol);

    for (int i = 0; i<n; i++)

{

        for (int j = 0; j<m; j++)

{

            scanf("%d", &pic[i][j]);

tpic[pic[i][j]]++;

}

}

    int flag, x, y, num;

    int exi = 0;

    for (int i = 0; i<n; i++)

    {

        for (int j = 0; j<m; j++)

        {

            flag = 1;

            if (j - 1 >= 0)//左

            {

                if ((pic[i][j] - pic[i][j - 1] <= tol) && (pic[i][j] - pic[i][j - 1] >= (-1 * tol)))

                    flag = 0;

            }

            if (j + 1<m)//右

            {

                if ((pic[i][j] - pic[i][j + 1] <= tol) && (pic[i][j] - pic[i][j + 1] >= (-1 * tol)))

                    flag = 0;

            }

            if (i - 1 >= 0)//上

            {

                if ((pic[i][j] - pic[i - 1][j] <= tol) && (pic[i][j] - pic[i - 1][j] >= (-1 * tol)))

                    flag = 0;

            }

            if (i + 1<n)//下

            {

                if ((pic[i][j] - pic[i + 1][j] <= tol) && (pic[i][j] - pic[i + 1][j] >= (-1 * tol)))

                    flag = 0;

            }

            if ((i - 1 >= 0) && (j - 1 >= 0))//左上

            {

                if ((pic[i][j] - pic[i - 1][j - 1] <= tol) && (pic[i][j] - pic[i - 1][j - 1] >= (-1 * tol)))

                    flag = 0;

            }

            if ((i - 1 >= 0) && (j + 1<m))//右上

            {

                if ((pic[i][j] - pic[i - 1][j + 1] <= tol) && (pic[i][j] - pic[i - 1][j + 1] >= (-1 * tol)))

                    flag = 0;

            }

            if ((i + 1 <n) && (j - 1 >= 0))//左下

            {

                if ((pic[i][j] - pic[i + 1][j - 1] <= tol) && (pic[i][j] - pic[i + 1][j - 1] >= (-1 * tol)))

                    flag = 0;

            }

            if ((i + 1 <n) && (j + 1 <m))//右下

            {

                if ((pic[i][j] - pic[i + 1][j + 1] <= tol) && (pic[i][j] - pic[i + 1][j + 1] >= (-1 * tol)))

                    flag = 0;

            }

            if (flag&&(tpic[pic[i][j]]==1))

            {

                exi++;

                x = j + 1;

                y = i + 1;

                num = pic[i][j];

            }

        }

    }

    if (!exi)

        printf("Not Exist\n");

    else if (exi == 1)

        printf("(%d, %d): %d", x, y, num);

    else

        printf("Not Unique\n");

    system("pause");

    return 0;

}