Codeforces Round #363 (Div. 2)B One Bomb

题意：

3 4

.*..

....

.*..

可以放一个炸弹，它炸整行整列，问能不能找到一个位置，一下炸掉所有'*'

'*'所在的位置也能放炸弹。

#include<stdio.h>
#include<iostream>
#include<math.h>
#include<string.h>
#include<iomanip>
#include<stdlib.h>
#include<ctype.h>
#include<algorithm>
#include<deque>
#include<functional>
#include<iterator>
#include<vector>
#include<list>
#include<map>
#include<queue>
#include<set>
#include<stack>
#define CPY(A, B) memcpy(A, B, sizeof(A))
typedef long long LL;
typedef unsigned long long uLL;
const int MOD = 1e9 + 7;
const int INF = 0x3f3f3f3f;
const LL INFF = 0x3f3f3f3f3f3f3f3fLL;
const double EPS = 1e-9;
const double OO = 1e20;
const double PI = acos (-1.0);
const int dx[] = {-1, 0, 1, 0};
const int dy[] = {0, 1, 0, -1};
using namespace std;
const int maxn=1010;
int AA[maxn][maxn];
int h[maxn],l[maxn];
int main() {
    int n,m,z=0; char c[maxn]; bool f=true;
    scanf ("%d%d",&n,&m);
    memset (AA,0,sizeof (AA) );
    memset (h,0,sizeof (h) );//每行有多少'*'
    memset (l,0,sizeof (l) );//每列有多少'*'
    for (int i=0; i<n; i++) {
        scanf ("%s",c);
        for (int j=0; j<m; j++) {
            if (c[j]=='*') {AA[i][j]=1; h[i]++; l[j]++; z++;}//z是‘*’总数
            else { AA[i][j]=0; }
        }
    }
    int x,y;
    for (int i=0; i<n; i++) {
        for (int j=0; j<m; j++) {
            if (AA[i][j]==1) {
                if ( (h[i]+l[j]) ==z+1) {
                    x=i+1,y=j+1; f=false;
                }
            } else {
                if ( (h[i]+l[j]) ==z) {
                    x=i+1,y=j+1; f=false;
                }
            }
        }
    }
    (f) ?printf ("NO\n") :printf ("YES\n%d %d",x,y);
    return 0;
}