随笔分类 - 线段树
摘要：题目 At the children's day, the child came to Picks's house, and messed his house up. Picks was angry at him. A lot of important things were lost, in pa
阅读全文
摘要：题目 You are given circular array a0, a1, ..., an - 1. There are two types of operations with it: inc(lf, rg, v) — this operation increases each element
阅读全文
摘要：题目In this problem, you have to analyze a particular sorting algorithm. The algorithm processes a sequence of n distinct integers by swapping two adjac
阅读全文
摘要：题目题目描述 原题来自：AHOI 2009 老师交给小可可一个维护数列的任务，现在小可可希望你来帮他完成。 有长为 n 的数列，不妨设为 a1,a2,⋯ ,ana_1,a_2,\cdots ,a_na1,a2,⋯,an。有如下三种操作形式： 把数列中的一段数全部乘一个值； 把数列中的一段数全部
阅读全文
摘要：题目 You have N integers, A1, A2, ... , AN. You need to deal with two kinds of operations. One type of operation is to add some given number to each num
阅读全文
摘要：题目There are several ancient Greek texts that contain descriptions of the fabled island Atlantis. Some of these texts even include maps of parts of the
阅读全文
摘要：题目 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
阅读全文
摘要：题目 You are given a sequence A of N (N <= 50000) integers between -10000 and 10000. On this sequence you have to apply M (M <= 50000) operations: modif
阅读全文
摘要：题目 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[i+1]+
阅读全文