lovemejj的博客

You are given a sequence A of N(N 18. On this sequence you have to apply M (M (A) For given x,y, for each elements between the x-th and the y-th ones (inclusively, counting from 1), modify it to its p

You are given a sequence A[1], A[2], ..., A[N] . ( |A[i]| <= 10000 , 1 <= N <= 10000 ). A query is defined as follows: Query(x1,y1,x2,y2) = Max { A[i]+A[i+1]+...+A[j] ; x1 <= i <= y1 , x2 <= j <= y2 a

GSS1 - Can you answer these queries I #tree You are given a sequence A[1], A[2], ..., A[N] . ( |A[i]| ≤ 15007 , 1 ≤ N ≤ 50000 ). A query is defined as follows:  Query(x,y) = Max { a[i]+a[

Area of Simple Polygons Time Limit: 1000MS   Memory Limit: 65536K Total Submissions: 3436   Accepted: 1771 Description There are N, 1 <= N <= 1,000 rectangles in the 2-D xy

题意：询问任意区间内，最大连续序列和（相等的值不重复计算），可以不选输出0； 这题可以说一眼看出是线段树了，可是怎么构造确实非常难. 现在假设线段树中的叶子为 s[i]. 每次更新 a[i]的时候，s[1] -s[i]区间内加上a[i];那么 s[1] = a[1] + a[2] + a[3] + ... + a[i]; s[2] = a[2] + a[3] + ... + a[i]

You are given a sequence A of N (N modify the i-th element in the sequence or for given x y print max{Ai + Ai+1 + .. + Aj | x Input The first line of input contains an integer N. The following