随笔分类 -  线段树&树状数组

摘要：---恢复内容开始---Tunnel WarfareTime Limit:2000MSMemory Limit:32768KB64bit IO Format:%I64d & %I64uDescriptionDuring the War of Resistance Against Japan, tun... 阅读全文

摘要：标题：Log大侠 atm参加了速算训练班，经过刻苦修炼，对以2为底的对数算得飞快，人称Log大侠。 一天，Log大侠的好友 drd 有一些整数序列需要变换，Log大侠正好施展法力... 变换的规则是： 对其某个子序列的每个整数变为: [log_2 (x) + 1] 其中 [] 表示向下取整，就是对每 阅读全文

摘要：Can you answer these queries? Crawling in process... Crawling failed Time Limit:2000MS Memory Limit:65768KB 64bit IO Format:%I64d & %I64uTime Limit:20 阅读全文

摘要：Balanced LineupCrawling in process... Crawling failed Time Limit:5000MS Memory Limit:65536KB 64bit IO Format:%I64d & %I64uTime Limit:5000MS Memory Lim... 阅读全文

摘要：DescriptionPainting some colored segments on a line, some previously painted segments may be covered by some the subsequent ones.Your task is counting... 阅读全文

摘要：Just a HookTime Limit:2000MSMemory Limit:32768KB64bit IO Format:%I64d & %I64uDescriptionIn the game of DotA, Pudge’s meat hook is actually the most ho... 阅读全文

摘要：Mayor's posters Time Limit:1000MS Memory Limit:65536KB 64bit IO Format:%I64d & %I64u Description The citizens of Bytetown, AB, could not stand that th 阅读全文

摘要：A Simple Problem with Integers Time Limit: 5000MS Memory Limit: 131072K Total Submissions: 89818 Accepted: 27967 Case Time Limit: 2000MS Description Y 阅读全文

摘要：问题描述 n 个小朋友站成一排。现在要把他们按身高从低到高的顺序排列，但是每次只能交换位置相邻的两个小朋友。 每个小朋友都有一个不高兴的程度。开始的时候，所有小朋友的不高兴程度都是0。 如果某个小朋友第一次被要求交换，则他的不高兴程度增加1，如果第二次要求他交换，则他的不高兴程度增加2（即不高兴程度 阅读全文

摘要：A Simple Problem with Integers Time Limit: 5000MS Memory Limit: 131072K Total Submissions: 85502 Accepted: 26556 Case Time Limit: 2000MS Description Y 阅读全文

摘要：敌兵布阵Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 64784Accepted Submission(s): 27303Problem Desc... 阅读全文

摘要：赤裸裸的线段树#include#include#include#define Max(a,b) (a>b)?a:busing namespace std;const int MAX_N=100005*4;//至少要开2*n-1个空间typedef long long LL;struct node{ ... 阅读全文