Intel Code Challenge Elimination Round (Div. 1 + Div. 2, combined) 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^2肯定 GG ，如果从后边找的话最大也就是n*log(n),但是加上路径压缩，差不多也就是n.

测试了下，路径不压缩差不多多了16ms。 压缩是93ms。

#include <iostream>  
#include <stdlib.h>  
#include <stdio.h>  
#include <string.h> 
#include <algorithm>   
#include <math.h>  
#include <cmath>  
#include <vector>  
#include <stack>  
#include <queue>  
#include <deque>
//#include <map>  
#include <set>  
#include <list>  
#include <bitset>  
#include <climits>  
#define lowbit(x) (x&-x)
#define gcd(a,b) __gcd(a,b)
#define mset(a,x) memset(a,x,sizeof(a))
#define FIN     freopen("input","r",stdin)
#define FOUT    freopen("output","w",stdout)
const int INF=0x3f3f3f3f;
const double pi=acos(-1.0);
const double esp=1e-6;
const int MAX=1e5+10;
const int mod=1e9+7;
typedef long long ll;
using namespace std;
inline ll lcm(ll a,ll b){return a/gcd(a,b)*b;}
inline ll qpow(ll a,ll b){ll r=1,t=a; while(b){if(b&1)r=(r*t)%mod;b>>=1;t=(t*t)%mod;}return r;}
inline ll inv1(ll b){return qpow(b,mod-2);}
inline ll inv2(ll b){return b==1?1:(mod-mod/b)*inv2(mod%b)%mod;}
inline ll exgcd(ll a,ll b,ll &x,ll &y){if(!b){x=1;y=0;return a;}ll r=exgcd(b,a%b,y,x);y-=(a/b)*x;return r;} 
int dir[4][2]={0,1,1,0,0,-1,-1,0};
int a[100005];
int b[100005];
ll c[100005];
int f[100005];
ll ans[100005];
int vis[100005];
int find(int x)
{
	int t=x;
	while(x!=f[x])
	{
		x=f[x];
	}
	int l1=x;
	int t1;
	while(t!=f[t])
	{
		t1=f[t];
		f[t]=l1;
		t=t1;
	}
	return l1;
}
int main ()
{
	int n;
	scanf("%d",&n);
	for(int i=1;i<=n;i++)
		scanf("%d",&a[i]);
	for(int i=1;i<=n;i++)
		scanf("%d",&b[i]); 
	mset(ans,0);
	mset(vis,0);
	mset(c,0);
	ans[n]=0; 
	for(int i=1;i<=n;i++)
		f[i]=i;
    for(int i=n;i>1;i--)
    {
    	int temp=b[i];//找到位置 
    	c[temp]=a[temp];
		if(vis[temp-1])//左边 
    	{
    		int fx=find(temp);
    		int fy=find(temp-1);
    		f[fx]=fy;
    		c[fy]=c[fy]+c[fx]; 
		}
		if(vis[temp+1])
		{
			int fx=find(temp);
			int fy=find(temp+1);
			f[fx]=fy;
			c[fy]=c[fy]+c[fx];
		}
		vis[temp]=1;
		ans[i-1]=max(ans[i],c[find(temp)]);
	}
	for(int i=1;i<=n;i++)
		printf("%lld\n",ans[i]);
	return 0;
}