记录每行每列还有总共的'*'的个数,然后枚举中点,如果从某个点出发,十字星范围内的星数等于总星数,说明找到了位置。否则-1
代码如下:
#include <iostream>
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <queue>
#include <map>
#include <stack>
#include <algorithm>
#include <cmath>
#define LL long long
#define Pr pair<int,int>
#define VI vector<int>
using namespace std;
const int INF = 0x3f3f3f3f;
const double eps = 1e-8;
const int msz = 1e5+1;
char mp[1111][1111];
int r[1111],c[1111];
int main()
{
int n,m;
scanf("%d%d",&n,&m);
memset(r,0,sizeof(r));
memset(c,0,sizeof(c));
int tot = 0;
for(int i = 0; i < n; ++i)
{
scanf("%s",mp[i]);
for(int j = 0; j < m; ++j)
{
if(mp[i][j] == '.') continue;
tot++;
r[i]++;
c[j]++;
}
}
int x,y;
x = -1;
for(int i = 0; i < n && x == -1; ++i)
for(int j = 0; j < m && x == -1; ++j)
{
if(r[i]+c[j]+(mp[i][j]=='*'? -1: 0) == tot)
{
x = i;
y = j;
}
}
if(x == -1) puts("NO");
else printf("YES\n%d %d\n",x+1,y+1);
return 0;
}