ZUFEOJ Home ProblemSet Source/Category Contest Status Ranklist F.A.Qs
Login Register

4547: Destroying Array

内存限制：256 MB 时间限制：2 S
题面：传统 评测方式：文本比较 上传者：
提交：2 通过：2
提交提交记录统计Web Board

题目描述

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≤100000)− 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 13*5. Segment with maximum sum 5 consists of one integer 5.
  2. Fourth element is destroyed. Array is now 13**. Segment with maximum sum 4 consists of two integers 13.
  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.

输入样例 复制

输出样例 复制

分类标签