这道题还是比较麻烦的一道题的,虽然不难
https://pintia.cn/problem-sets/994805260223102976/problems/994805265579229184
要注意以下几点:
1.要求你找出万绿丛中的一点红,即有独一无二颜色的那个像素点
注意“独一无二”
2.色差超过 TOL 的点才被考虑,“超过”
3.所有的点都是候选点
#include <iostream>
#include <cmath>
#include <map>
using namespace std;
int picture[1005][1005] = {0}, sub1, sub2, num;
map<int, int> match;
int main(){
int M, N, tol, cnt = 0, f = 0;
cin >> M >> N >> tol;
for(int i = 1; i < N+1; i++){
for(int j = 1; j < M+1; j++){
cin >> picture[i][j];
match[picture[i][j]]++;
}
}
for(int i = 1; i <= N; i++){
for(int j = 1; j <= M; j++){
int flag = 0;
if(match[picture[i][j]] != 1)
continue;