Codeforces Round #360 (Div. 1) D Dividing Kingdom II（并查集+暴力） ★ ★

题意：给你一个n个点,m条边的图，q次询问，每次询问给出[L,R]，用在[L,R]以内的边构成一个图，然后把这个图的点集分成两个部分，求连接同一个部分的点的最长边最小是多小

思路：直接mq暴力+并查集....

虚点建立得好巧妙啊

#include <set>
#include <map>
#include <stack>
#include <queue>
#include <deque>
#include <cmath>
#include <vector>
#include <string>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <algorithm>
using namespace std;
#define L(i) i<<1
#define R(i) i<<1|1
#define INF  0x3f3f3f3f
#define pi acos(-1.0)
#define eps 1e-9
#define maxn 1000100
#define MOD 1000000007

struct Edge
{
    int x,y,w,pos;
    bool operator <(const Edge &a)const
    {
        return w > a.w;
    }
}edge[maxn<<1];
int n,m,q;
int fa[maxn<<1];
int Find(int x)
{
    return x == fa[x]?x:fa[x] = Find(fa[x]);
}
void Union(int x,int y)
{
    int px = Find(x);
    int py = Find(y);
    if(px != py)
        fa[px] = py;
}
int main()
{
    int t;
    //scanf("%d",&t);
    while(scanf("%d%d%d",&n,&m,&q) != EOF)
    {
        for(int i = 0; i < m; i++)
        {
            scanf("%d%d%d",&edge[i].x,&edge[i].y,&edge[i].w);
            edge[i].pos = i+1;
        }
        sort(edge,edge+m);
        while(q--)
        {
            for(int i = 1; i <= 2*n; i++)
                fa[i] = i;
            int x,y;
            scanf("%d%d",&x,&y);
            int flag = 0;
            for(int i = 0; i < m; i++)
            {
                if(edge[i].pos > y || edge[i].pos < x)
                    continue;
                if(Find(edge[i].x) == Find(edge[i].y))
                {
                    printf("%d\n",edge[i].w);
                    flag = 1;
                    break;
                }
                else
                {
                    Union(Find(edge[i].x),Find(edge[i].y+n));
                    Union(Find(edge[i].x+n),Find(edge[i].y));
                }
            }
            if(!flag)
                printf("-1\n");
        }
    }
    return 0;
}