← 返回题目
题库练习 Destroying Array
← 上一题 下一题 →

A10636 | Destroying Array

时间限制1s
内存限制256MB
通过 / 提交0/0

题目描述

You are given an array consisting of $n$ non-negative integers $a_{1},a_{2},...,a_{n}$ .

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$ .

输入格式

The first line of the input contains a single integer $n$ ( $1<=n<=100000$ ) — the length of the array.

The second line contains $n$ integers $a_{1},a_{2},...,a_{n}$ ( $0<=a_{i}<=10^{9}$ ).

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

输出格式

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.

输入输出样例

输入 #1
4
1 3 2 5
3 4 1 2
输出 #1
5
4
3
0
输入 #2
5
1 2 3 4 5
4 2 3 5 1
输出 #2
6
5
5
1
0
输入 #3
8
5 5 4 4 6 6 5 5
5 2 8 7 1 3 4 6
输出 #3
18
16
11
8
8
6
6
0
C++ 编辑器
输入
输出