【codeforces 722C】【逆向思维 离线+并查集】C. Destroying Array 【给你n个数，每次摧毁一个，求每摧毁一个的最大连续和（被摧毁的点的两边不连续）】

传送门：C. Destroying Array

描述：

C. Destroying Array

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

You are given an array consisting of n non-negative integers a1, a2, ..., an.

You are going to destroy integers in the array one by one. Thus, you are given the permutation of integers from 1 to n defining the order elements of the array are destroyed.

After each element is destroyed you have to find out the segment of the array, such that it contains no destroyed elements and the sum of its elements is maximum possible. The sum of elements in the empty segment is considered to be 0.

Input

The first line of the input contains a single integer n (1 ≤ n ≤ 100 000) — the length of the array.

The second line contains n integers a1, a2, ..., an (0 ≤ ai ≤ 109).

The third line contains a permutation of integers from 1 to n — the order used to destroy elements.

Output

Print n lines. The i-th line should contain a single integer — the maximum possible sum of elements on the segment containing no destroyed elements, after first i operations are performed.

Examples

input

4
1 3 2 5
3 4 1 2

output

5
4
3
0

input

5
1 2 3 4 5
4 2 3 5 1

output

6
5
5
1
0

input

8
5 5 4 4 6 6 5 5
5 2 8 7 1 3 4 6

output

18
16
11
8
8
6
6
0

Note

Consider the first sample:

1. Third element is destroyed. Array is now 1 3  *  5. Segment with maximum sum 5 consists of one integer 5.
2. Fourth element is destroyed. Array is now 1 3  *   * . Segment with maximum sum 4 consists of two integers 1 3.
3. First element is destroyed. Array is now  *  3  *   * . Segment with maximum sum 3 consists of one integer 3.
4. Last element is destroyed. At this moment there are no valid nonempty segments left in this array, so the answer is equal to 0.
   

题意：

给你n个数，每次摧毁一个，求每摧毁一个的最大连续和（被摧毁的点的两边不连续）。

思路：

并查集，离线操作。

将操作倒着进行，一开始所有数字都没有加入到数组中，然后倒着一个一个加入，更新最大值。

#include <bits/stdc++.h>
#define pr(x) cout << #x << "= " << x << "  " ；
#define pl(x) cout << #x << "= " << x << endl;
#define ll __int64
using  namespace  std;

const int N=1e5+10;
int p[N],b[N],vis[N],n;
ll a[N],sum[N],ans[N];

int Find(int x){
  return p[x]==x?x:p[x]=Find(p[x]);
}

void unite(int a, int b){
  if(b>n || b<0)return;
  if(vis[b]==0)return;
  a=Find(a);b=Find(b);
  if(a!=b){
    p[b]=a;
    sum[a]=sum[a]+sum[b];
    sum[b]=0;
  }
}

int  main(){
  std::ios::sync_with_stdio(false);
  std::cin.tie(0);

  cin>>n;
  for(int i=1; i<=n; i++)p[i]=i;
  for(int i=1; i<=n; i++)cin>>a[i];
  for(int i=1; i<=n; i++)cin>>b[i];
  for(int i=1; i<=n; i++)sum[i]=a[i];
  ll mx=0;
  for(int i=n; i>=1; i--){
    ans[i]=mx;vis[b[i]]=1;
    unite(b[i], b[i]-1);//向前合并
    unite(b[i], b[i]+1);//向后合并
    mx=max(mx, sum[b[i]]);
  }
  for(int i=1; i<=n; i++)cout<<ans[i]<<endl;
  return 0;
}