CF Intel Code Challenge Elimination Round C 并查集

题目传送门 ： http://codeforces.com/contest/722/problem/C

题意：先给n个数p1,p2,....pn分别代表1，2......n位置的权值，然后再给n个数，b1,b2...bn，分别挖去p数组中b数组所对应的值，然后每挖去一个数，求剩余区间和最大的值

思路：这题猛的一看还以为是线段树，但经过组里的菊苣提醒，发现并查集就可以解决，倒着做就行

代码如下：

#include <iostream>
#include <algorithm>
#include <cstring>
#include <stdio.h>
#include <string>
#include <cmath>
#include <queue>

using namespace std;
#define   lson          l,m,rt<<1
#define   rson          m+1,r,rt<<1|1
#define   ll            long long
#define   ull           unsigned long long
#define   mem(n,v)      memset(n,v,sizeof(n))
#define   MAX           100005
#define   MAXN          2000005
#define   PI            3.1415926
#define   E             2.718281828459
#define   opnin         freopen("text.in.txt","r",stdin)
#define   opnout        freopen("text.out.txt","w",stdout)
#define   clsin         fclose(stdin)
#define   clsout        fclose(stdout)

const int    INF    =   0x3f3f3f3f;
const ll     INFF   =   0x3f3f;
const double pi     =   3.141592653589793;
const double inf    =   1e18;
const double eps    =   1e-8;
const ll     mod    =   1e9+7;
const ull    mx     =   133333331;
ll a[MAX];
ll b[MAX];
ll val[MAX];

int Set[MAX]; 
bool vis[MAX];
ll ans[MAX];
void init(int n)
{
    int i;
    mem(a,0);
    mem(b,0);
    mem(ans,0);
    for(i=1;i<=n;++i)
    {
        Set[i]=i;
        vis[i]=0;
    }
}
int Find(int x)
{
    return Set[x]=Set[x]==x?x:Find(Set[x]); 
}
void Merge(int a,int b) 
{
    int sa=Find(a);
    int sb=Find(b);
    if(sa!=sb) Set[sa]=sb;
}

int main()
{
    int n;
    cin >> n;
    init(n);
    for(int i=1;i<=n;i++){
        cin >> a[i];
        val[i] = a[i];
    }
    for(int j=1;j<=n;j++){
        cin >> b[j];
    }
    ll Max = 0;
    ll ans[MAX];
    for(int i=n;i>=2;i--){
        Max = max(Max,val[Find(b[i])]);
        vis[b[i]] = 1;
        if(vis[b[i]-1]){
            val[Find(b[i]-1)] += val[Find(b[i])];
            Merge(b[i],b[i]-1);
            Max = max(Max,val[Find(b[i]-1)]);
        }
        if(vis[b[i]+1]){
            val[Find(b[i]+1)] += val[Find(b[i])];
            Merge(b[i],b[i]+1);
            Max = max(Max,val[Find(b[i]+1)]);
        }
        ans[i] = Max;
    }
    ans[n+1] = 0;
    for(int i=2;i<=n+1;i++)
        cout << ans[i] << endl;


    return 0;
}