# BZOJ 1619: [Usaco2008 Nov]Guarding the Farm 保卫牧场

## 1619: [Usaco2008 Nov]Guarding the Farm 保卫牧场

Time Limit: 5 Sec   Memory Limit: 64 MB
Submit: 491   Solved: 218
[ Submit][ Status]

## Description

The farm has many hills upon which Farmer John would like to place guards to ensure the safety of his valuable milk-cows. He wonders how many guards he will need if he wishes to put one on top of each hill. He has a map supplied as a matrix of integers; the matrix has N (1 < N <= 700) rows and M (1 < M <= 700) columns. Each member of the matrix is an altitude H_ij (0 <= H_ij <= 10,000). Help him determine the number of hilltops on the map. A hilltop is one or more adjacent matrix elements of the same value surrounded exclusively by either the edge of the map or elements with a lower (smaller) altitude. Two different elements are adjacent if the magnitude of difference in their X coordinates is no greater than 1 and the magnitude of differences in their Y coordinates is also no greater than 1.

## Input

* Line 1: Two space-separated integers: N and M

* Lines 2..N+1: Line i+1 describes row i of the matrix with M space-separated integers: H_ij

## Output

* Line 1: A single integer that specifies the number of hilltops

8 7
4 3 2 2 1 0 1
3 3 3 2 1 0 1
2 2 2 2 1 0 0
2 1 1 1 1 0 0
1 1 0 0 0 1 0
0 0 0 1 1 1 0
0 1 2 2 1 1 0
0 1 1 1 2 1 0

3

## HINT

三个山丘分别是：左上角的高度为4的方格，右上角的高度为1的方格，还有最后一行中高度为2的方格．

FloodFill解决、、我同样的程序一次0msTLE，一次AC好可怕！果然，OJ觉得我的程序运行一定会T，所以运行都不运行就丢我了一个TLE嘛！好智能！

/*Author:WNJXYK*/
#include<cstdio>
using namespace std;

const int Maxn=1000;
int map[Maxn+10][Maxn+10];
bool visited[Maxn+10][Maxn+10];
int n,m;
int Ans=0;
int dx[]={0,1,1,0,-1,-1,-1,0,1};
int dy[]={0,0,1,1,1,0,-1,-1,-1};
bool flood(int nx,int ny){
bool flag=true;
visited[nx][ny]=true;
for (int i=1;i<=8;i++){
int x=nx+dx[i],y=ny+dy[i];
if (!(1<=x && x<=n && 1<=y && y<=m)) continue;
if (map[nx][ny]==map[x][y] && visited[x][y]==false) flag=flag&flood(x,y);
if (map[nx][ny]<map[x][y]) flag=false;
}
return flag;
}
int main(){
scanf("%d%d",&n,&m);
for (int i=1;i<=n;i++)
for (int j=1;j<=m;j++)
scanf("%d",&map[i][j]);
for (int i=1;i<=n;i++)
for (int j=1;j<=m;j++)
if (visited[i][j]==false) Ans+=flood(i,j);
printf("%d\n",Ans);
return 0;
}