先看看自己以前的题,找回点自己以前的思想,这题是我大一刚刚学C时写的,当时在练这题时,他们都说用搜索,但我用的是贪心,贪心一般是说找最多,这里我找的是最少,一个一个找下来,就OK了,你先找到这个点能被几个点打到,然后你就能求出最少要用几个点了。当时的代码写的是笨了点,但想法还是挺不错的。
Suppose that we have a square city with straight streets. A map of a city is a square board with n rows and n columns, each representing a street or a piece of wall.
A blockhouse is a small castle that has four openings through which to shoot. The four openings are facing North, East, South, and West, respectively. There will be one machine gun shooting through each openin