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

## 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的方格．

#include<cstdio>
#include<algorithm>
using namespace std;
const int mx[8]={1,1,1,0,0,-1,-1,-1};
const int my[8]={1,0,-1,1,-1,1,0,-1};
{
int x=0,f=1;char ch=getchar();
while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}
while(ch>='0'&&ch<='9'){x=x*10+ch-'0';ch=getchar();}
return x*f;
}
struct point{
int x,y,t;
}dat[500000];
int n,m,ans;
int a[1100][1100];
bool mark[1100][1100];
inline void dfs(int x,int y)
{
mark[x][y]=1;
for (int k=0;k<8;k++)
{
int nx=x+mx[k];
int ny=y+my[k];
if (nx>0&&ny>0&&nx<=n&&ny<=m&&a[x][y]>=a[nx][ny]&&!mark[nx][ny]) dfs(nx,ny);
}
}

inline bool cmp(point a,point b)
{return a.t>b.t;}
int main()
{
for (int i=1;i<=n;i++)
for (int j=1;j<=m;j++)
{
int now=(i-1)*m+j;
dat[now].t=a[i][j];

dat[now].x=i;
dat[now].y=j;
}
sort(dat+1,dat+n*m+1,cmp);
for (int i=1;i<=n*m;i++)
{
int x=dat[i].x,y=dat[i].y;
if(!mark[x][y]){dfs(x,y);ans++;}
}
printf("%d",ans);
}


09-05 27