cdoj island（并查集）

#include <iostream>
#include <iomanip>
#include <cstdio>
#include <set>
#include <vector>
#include <map>
#include <cmath>
#include <algorithm>
#include <memory.h>
#include <string>
#include <cstring>
#include <sstream>
#include <cstdlib>
#include <ctime>
#include <cassert>
using namespace std;
#define maxn 1000005
#define maxy 100005
struct land
{
    int r,c;
    int height;
}land[maxn];
int ans[maxy],n,m,h[maxn],year[maxy],Set[maxn];
int rd[][2]={0,1,0,-1,-1,0,1,0};
int cmp(struct land a,struct land b)
{  return a.height<b.height;
}
//查找所在集合
int Find(int i)
{   if(i!=Set[i])
     Set[i] = Find(Set[i]);
    return Set[i];
}
void solve(int nyear)
{  int i,j;
    i=m*n;j=nyear;
    //水深变化
    for(;j>0;j--)
    {
        ans[j]=ans[j+1];
        for(;year[j]<land[i].height&&i>0;i--)
        {
            ans[j]++;
            int loc1=(land[i].r-1)*m+land[i].c;
            int V1=Find(loc1);
        //扫描四周，是否联通
             for(int t=0;t<4;t++)
            {
                int rr = land[i].r + rd[t][1];
                int cc = land[i].c + rd[t][0];
                if(rr>0&&cc>0&&rr<=n&&cc<=m)
                {
                    int loc2= (rr-1)*m+cc;
                    int  V2=Find(loc2);
                    if(V1==V2||h[loc2]<=year[j]) continue;
                    else
                    {
                        Set[V2]=V1;
                        ans[j]--;
                    }
                }
            }
        }
    }
}
int main()
{
    int T,i,j;
    scanf("%d",&T);
    while(T--)
    {
        scanf("%d%d",&n,&m);
        for(i=1;i<=n;i++)
           for(j=1;j<=m;j++)
         {   int  loc=(i-1)*m+j;
             scanf("%d",&h[loc]);
             land[loc].r =i,land[loc].c =j;
             land[loc].height=h[loc];
             Set[loc] =loc;
          }
        //对所有高度进行排序
        sort(land+1,land+1+m*n,cmp);
        int nyear;
        scanf("%d",&nyear);
        for(i=1;i<=nyear;i++)
            scanf("%d",&year[i]);
        memset(ans,0,n*sizeof(int));
        solve(nyear);
        for(i=1;i<=nyear;i++)
           printf("%d ",ans[i]);
        printf("\n");
    }
    return 0;
}