随笔分类 - 线段树
摘要：#include<iostream> #include<cstdio> using namespace std; const int N = 1e5 + 5; int f[N<<2];//区间数之和 int lazy[N<<2];//暂存变化，用于是否进行pushdown 的推断 void push
阅读全文
摘要：Time Limit:2000MS Memory Limit:262144KB 64bit IO Format:%I64d & %I64u Submit Status Description DZY loves colors, and he enjoys painting. On a colorfu
阅读全文
摘要：H - Code For 1 Time Limit:2000MS Memory Limit:262144KB 64bit IO Format:%I64d & %I64u Submit Status Description Jon fought bravely to rescue the wildli
阅读全文
摘要：B - Mayor's posters Time Limit:1000MS Memory Limit:65536KB 64bit IO Format:%I64d & %I64u Submit Status Description The citizens of Bytetown, AB, could
阅读全文
摘要：Description A lot of battleships of evil are arranged in a line before the battle. Our commander decides to use our secret weapon to eliminate the bat
阅读全文
摘要：Description There is an old country and the king fell in love with a devil. The devil always asks the king to do some crazy things. Although the king
阅读全文
摘要：Description When I wrote down this letter, you may have been on the airplane to U.S.We have known for 15 years, which has exceeded one-fifth of my who
阅读全文
摘要：Description Given n integers.You have two operations:U A B: replace the Ath number by B. (index counting from 0)Q A B: output the length of the longes
阅读全文
摘要：Description We'll call an array of n non-negative integers a[1], a[2], ..., a[n]interesting, if it meets m constraints. The i-th of the m constraints
阅读全文
摘要：Description 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 lo
阅读全文
摘要：Description During the War of Resistance Against Japan, tunnel warfare was carried out extensively in the vast areas of north China Plain. Generally s
阅读全文
摘要：Description You are given circular array a0, a1, ..., an - 1. There are two types of operations with it: inc(lf, rg, v) — this operation increases eac
阅读全文
摘要：Description Recently, Doge got a funny birthday present from his new friend, Protein Tiger from St. Beeze College. No, not cactuses. It's a mysterious
阅读全文
摘要：Description N个气球排成一排，从左到右依次编号为1,2,3....N.每次给定2个整数a b(a <= b),lele便为骑上他的“小飞鸽"牌电动车从气球a开始到气球b依次给每个气球涂一次颜色。但是N次以后lele已经忘记了第I个气球已经涂过几次颜色了，你能帮他算出每个气球被涂过几次颜色
阅读全文
摘要：Description Chinese always have the railway tickets problem because of its' huge amount of passangers and stations. Now goverment need you to develop
阅读全文
摘要：L - Just a Hook Time Limit:2000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64u Description In the game of DotA, Pudge’s meat hook is actually th
阅读全文
