题目链接
这道题槽点太多,做到崩溃。。
注意点:
1.并不是满足周围点色差超过阈值即可,还要满足该点的值唯一;
2.题目虽然说了要满足周围八个点,你以为只用考虑矩阵中间的,但实际上你也要考虑边界。。。
3.要利用绝对值,因为是差值;
我初步的想法是利用一个结构体,记录满足阈值差的点,然后利用循环判断是否在数组中唯一,若唯一,才算作一个点;
但下面的代码始终ac不了,测试三始终不对,崩溃了。。。。
#include <iostream>
#include<stdio.h>
#include<algorithm>
#include<string.h>
#include<string>
#include<stack>
#include<math.h>
#include<vector>
using namespace std;
int abs(int x) {
if (x >= 0) return x;
else return -x;
}
int a[1005][1005];
struct doc {//记录满足色差的阈值的点;
int x, y, val;
}b[1005];
int main() {
int m, n, tol;
cin >> m >> n >> tol;
for (int i = 1;i <= n;i++)
for (int j = 1;j <= m;j++)
cin >> a[i][j];
int count = 0;//计数;
int x, y;
for(int i=1;i<=n;i++)
for (int j = 1;j <= m ;j++)
{
if (abs(a[i - 1][j - 1] - a[i][j]) <= tol && i - 1 >= 1 && j - 1 >= 1) continue;
else if (abs(a[i - 1][j ] - a[i][j]) <= tol && i - 1 >= 1) continue;
else if (abs(a[i - 1][j + 1] - a[i][j]) <= tol &&i-1>=1&&j+1<=m) continue;
else if (abs(a[i ][j - 1] - a[i][j]) <= tol&&j-1>=1) continue;
else if (abs(a[i][j + 1] - a[i][j]) <= tol&&j+1<=m) continue;
else if (abs(a[i + 1][j - 1] - a[i][j]) <= tol&&i+1<=n&&j-1>=1) continue;
else if (abs(a[i + 1][j] - a[i][j]) <= tol&&i+1<=n) continue;
else if (abs(a[i + 1][j + 1] - a[i][j]) <= tol&&i+1<=n&&j+1<=m) continue;
else {
count++;
b[count].x = i;b[count].y = j;b[count].val = a[i][j]; //记录行列坐标和值
//cout << a[i][j] << " " << i << j << endl;//查看情况;
}
}
int count2 = 0;
int markx, marky;
for (int t = 1;t <= count;t++)//判断重复出现的次数;
{ int flag = 0;
for (int i = 1;i <= n;i++)
for (int j = 1;j <= m;j++)
if (a[i][j] == b[t].val) flag++;
if (flag == 1) {
count2++;
if (count2 == 1) {
markx = b[count].x ;
marky = b[count].y;
}
}
// cout << flag;
}
//cout << count2;
if (count2 == 1) cout << "(" << marky << ", " << markx << "): " << a[markx][marky] << endl;
else if (count2 > 1) cout << "Not Unique" << endl;
else cout << "Not Exist";
return 0;
}
借鉴的思路,这个更加效率,利用了一个大数组,hash的思想,根据值,存放元素加一,简化唯一性的判断;
#include <iostream>
#include <string>
using namespace std;
#define maxn 16*1024*1024
long long a[1010][1010];
long long b[maxn];
int main(){
int m,n;
long long tol;
scanf("%d%d%lld",&m,&n,&tol);
int i,j; //n行m列
long long num;
for(i=1;i<=n;i++){
for(j=1;j<=m;j++){
scanf("%lld",&num);
a[i][j]=num;
b[num]++;
}
}
for(i=0;i<=m+1;i++){//给这个矩阵加个边框,值初始化为0
a[0][i]=0;
}
for(i=0;i<=m+1;i++){
a[n+1][i]=0;
}
for(i=0;i<=n+1;i++){
a[i][0]=0;
}
for(i=0;i<=n+1;i++){
a[i][m+1]=0;
}
int pos_i,pos_j;
int sum=0;
for(i=1;i<=n;i++){
for(j=1;j<=m;j++){
if(b[a[i][j]]>1){
continue;
}
if(abs(a[i][j]-a[i-1][j])>tol&&abs(a[i][j]-a[i+1][j])>tol&&abs(a[i][j]-a[i][j-1])>tol&&abs(a[i][j]-a[i][j+1])>tol
&&abs(a[i][j]-a[i-1][j-1])>tol&&abs(a[i][j]-a[i+1][j-1])>tol&&abs(a[i][j]-a[i-1][j+1])>tol&&abs(a[i][j]-a[i+1][j+1])>tol){
sum++;
pos_i=i;pos_j=j;
}
}
}
if(sum==1){
printf("(%d, %d): %lld",pos_j,pos_i,a[pos_i][pos_j]);
}else if(sum==0){
printf("Not Exist");
}else printf("Not Unique");
return 0;
}