722C - Destroying Array 线段树
来源:互联网 发布:知之阅读 pdf 编辑:程序博客网 时间:2024/06/05 06:44
You are given an array consisting of n non-negative integersa1, a2, ..., an.
You are going to destroy integers in the array one by one. Thus, you are given the permutation of integers from1 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 be0.
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.
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 firsti operations are performed.
41 3 2 53 4 1 2
5430
51 2 3 4 54 2 3 5 1
65510
85 5 4 4 6 6 5 55 2 8 7 1 3 4 6
18161188660
Consider the first sample:
- Third element is destroyed. Array is now 1 3 * 5. Segment with maximum sum5 consists of one integer 5.
- Fourth element is destroyed. Array is now 1 3 * * . Segment with maximum sum4 consists of two integers 1 3.
- First element is destroyed. Array is now * 3 * * . Segment with maximum sum3 consists of one integer 3.
- Last element is destroyed. At this moment there are no valid nonempty segments left in this array, so the answer is equal to0.
#include<stdio.h>#include<algorithm>#include<string.h>using namespace std;const int maxm=100005;typedef struct{int l,r,ll,rr;__int64 ls,rs,ms;}H;H tree[maxm*4];__int64 f[maxm*4];void make(int a,int b,int num);void push_back(int num,int len);void update(int k,int num);int main(){int n,i,j,k,sum,m;scanf("%d",&n);for(i=1;i<=n;i++)scanf("%I64d",&f[i]);make(1,n,1);for(i=1;i<=n;i++){scanf("%d",&k);update(k,1);printf("%I64d\n",tree[1].ms);}return 0;}void make(int a,int b,int num){tree[num].ll=tree[num].rr=b-a+1;tree[num].l=a;tree[num].r=b;if(a==b){tree[num].ls=tree[num].rs=tree[num].ms=f[a];return;}int mid=(a+b)/2;make(a,mid,num*2);make(mid+1,b,num*2+1);tree[num].ls=tree[num].rs=tree[num].ms=tree[num*2].ms+tree[num*2+1].ms;}void update(int k,int num){int s=tree[num].l,e=tree[num].r;if(s==e){tree[num].ll=tree[num].rr=0;tree[num].ls=tree[num].rs=tree[num].ms=0;return;}int mid=(s+e)/2;if(k<=mid)update(k,num*2);else if(k>mid)update(k,num*2+1);push_back(num,e-s+1);}void push_back(int num,int len){tree[num].ls=tree[num*2].ls;tree[num].ll=tree[num*2].ll;if(tree[num].ll==len-len/2){tree[num].ll+=tree[num*2+1].ll;tree[num].ls+=tree[num*2+1].ls;}tree[num].rs=tree[num*2+1].rs;tree[num].rr=tree[num*2+1].rr;if(tree[num].rr==len/2){tree[num].rr+=tree[num*2].rr;tree[num].rs+=tree[num*2].rs;}tree[num].ms=max(tree[num*2].ms,tree[num*2+1].ms);tree[num].ms=max(tree[num].ms,tree[num*2].rs+tree[num*2+1].ls);}
- 722C - Destroying Array 线段树
- codeforces 722C Destroying Array 【线段树好题】
- codeforces 722C Destroying Array
- codeforces(722c)-Destroying Array
- Codeforces 722C. Destroying Array
- codefoces 722C - Destroying Array
- codeforces 722C. Destroying Array
- codeforces Destroying Array 线段树维护区间
- Intel Code Challenge Elimination Round C Destroying Array(线段树)
- 【37.38%】【codeforces 722C】Destroying Array
- codeforces 722C. Destroying Array map+multiset
- Codeforces 722C - Destroying Array By Assassin
- CodeForces - 722C Destroying Array (set)
- Codeforces #722C: Destroying Array 题解
- codeforces 722C Destroying Array 并查集带权
- Codeforces722 C Destroying Array
- Codeforces722C-Destroying Array(线段树 or 并查集)
- codeforces-772C-Destroying Array
- 万事不要太过强求
- hdu1016 Prime Ring Problem(dfs)
- 《机器学习》学习笔记一
- 初学Java Socket编程实现简单的问候服务
- 阿里云服务器搭建
- 722C - Destroying Array 线段树
- Swift学习记录 -- 7.数组的基本操作
- Why OpenCV is slower than Matlab in matrix related operation,如:特征值分解,奇异值分解
- USB枚举过程
- ubuntu16.04安装最新版本的wine
- [50Tproject-13]
- SocketException类型的未处理异常在System.dll中发生
- Vuroria增强现实平台,Unity工具开发——ImageTarget Package 个性化更换UI菜单
- hibernate3.3.2学习笔记---将一棵树存进数据库