Connections in Galaxy War----zoj3261

#include<stdio.h>
#include<string.h>
#include<iostream>
#include<algorithm>
#include<math.h>
#include<map>
#define N 50010
#define INF 0xfffffff
using namespace std;

struct node
{
    int op,x,y;// 1代表查询，2代表破坏；
} a[N],b[N];

int f[N], p[N], n, m, ans[N];

map<int,int> maps[N];

int Find(int x)
{
    if(x != f[x])
        f[x] = Find(f[x]);
    return f[x];
}

void Union(int x, int y)
{
    int px = Find(x);
    int py = Find(y);
    if(p[px] > p[py])
        f[py] = px;
    else if(p[px] < p[py])
        f[px] = py;
    else
    {
        if(px <= py)
            f[py] = px;
        else
            f[px] = py;
    }
}
void Init()
{
    int i;
    memset(a, 0, sizeof(a));
    memset(b, 0, sizeof(b));
    for(i=0; i<= n;i++)
    {
        maps[i].clear();
        f[i] = i;
        p[i] = 0;
    }
}
int main()
{
    char str[20];
    int i, j, y, x, Q, flag=0;
    while(scanf("%d", &n)!=EOF)
    {
        Init();
        for(i=0; i<n; i++)
            scanf("%d", &p[i]);
        scanf("%d", &m);
        for(i=0; i<m; i++)
        {
            scanf("%d%d", &x, &y);
            if(x > y) swap(x, y);
            b[i].x = x;
            b[i].y = y;
            maps[x][y] = 1;//代表x和y之间的通道存在；
        }

        scanf("%d", &Q);
        for(i=0; i<Q; i++)
        {
            scanf("%s", str);
            if(str[0] == ‘q‘)
            {
                scanf("%d", &x);
                a[i].op = 1;
                a[i].x = x;
            }
            else
            {
                scanf("%d %d", &x, &y);
                if(x > y) swap(x, y);
                maps[x][y] = 0;//x和y之间的路没路；
                a[i].op = 2;
                a[i].x = x;
                a[i].y = y;
            }
        }
        for(i=0; i<m; i++)//把相关联的放到一起；
        {
            if(maps[b[i].x][b[i].y]==1)
                Union(b[i].x, b[i].y);
        }
        j=0;
        for(i=Q-1; i>=0; i--)//逆序处理每个操作；
        {
            if(a[i].op == 1)
            {
                int px = Find(a[i].x);
                if(p[px] > p[a[i].x])
                    ans[j++] = px;
                else
                    ans[j++] = -1;
            }
            else if(a[i].op == 2)
                Union(a[i].x, a[i].y);
        }
        if(flag==0)
            flag=1;
        else
            printf("\n");
        for(i=j-1; i>=0; i--)
            printf("%d\n", ans[i]);

    }
    return 0;
}