Codeforces--965B--Battleship

题目描述：
Arkady is playing Battleship. The rules of this game aren’t really important.
There is a field of n×n cells. There should be exactly one k-decker on the field, i. e. a ship that is k cells long oriented either horizontally or vertically. However, Arkady doesn’t know where it is located. For each cell Arkady knows if it is definitely empty or can contain a part of the ship.
Consider all possible locations of the ship. Find such a cell that belongs to the maximum possible number of different locations of the ship.
输入描述:
The first line contains two integers n and k (1≤k≤n≤100) — the size of the field and the size of the ship.
The next n lines contain the field. Each line contains n characters, each of which is either ‘#’ (denotes a definitely empty cell) or ‘.’ (denotes a cell that can belong to the ship).
输出描述:
Output two integers — the row and the column of a cell that belongs to the maximum possible number of different locations of the ship.
If there are multiple answers, output any of them. In particular, if no ship can be placed on the field, you can output any cell.
输入：
4 3
#…#
#.#.
…
.###
10 4
#…##…
.#…#…
…#…#…#.
…#.#…
.#…##.#…
…#…#
…#.##…
.#…#.#…
…#…#.
…#.#…#
19 6
##…###
#…#####…##
…#########…
…###########…
…#############…
…###############…
.#################.
.#################.
.#################.
.#################.
#####…##…####
####…###
####…###
#####…####…####
.#####…####…#####
…###…###…
…###########…
…##…
#…#
输出：
3 2
6 1
1 8
题意：
有一个n×n个单元的区域与一艘长度为k宽度为1的宇宙飞船。宇宙飞船可以水平或垂直放置。但是不知道其位置。对于每个单元格，都知道它是否可以容纳宇宙飞船的一部分。找到一个单元格，该单元格上宇宙飞船可能出现的次数最大。
题解：
枚举每一个点开始向下向右找
代码：

#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
using namespace std;

const int maxn = 100 + 5;
int n