60求条，必观

#include <bits/stdc++.h>
using namespace std;

int main()
{
	int n,m;
	cin>>n>>m;
	char a[n+100][m+100];

	for(int i=1;i<=n;i++){
		for(int j=1;j<=m;j++){
			cin>>a[i][j];
		}
	}
	int cnt=0;
	for(int i=1;i<=n;i++){
		for(int j=1;j<=m;j++){
			if(a[i][j]=='#'){
				continue;
			}
			if(a[i-1][j]=='#'){
				continue;
			}
			if(a[i+1][j]=='#'){
				continue;
			}
			if(a[i][j-1]=='#'){
				continue;
			}
			if(a[i][j+1]=='#'){
				continue;
			}
			cnt++;
		}
	}	
	int maxn=0;
	for(int i=1;i<=n;i++){
		for(int j=1;j<=m;j++){
			if(a[i][j]=='#'){
				int shu=0;
			if(a[i-1][j]=='.'){
				shu++;
			}
			if(a[i+1][j]=='.'){
				shu++;
			}
			if(a[i][j-1]=='.'){
				shu++;
			}
			if(a[i][j+1]=='.'){
				shu++;
			}
			
				maxn=max(maxn,shu);
			
			}
		}
	}	
	cout<<maxn+cnt+1;
    return 0;
}