userluoxuan的专栏

http://www.topcoder.com/tc?module=Static&d1=tutorials&d2=binaryIndexedTrees#prob树状数组中用的d【】，每个点都有一定的管辖范围；如d[1]=a[1];d[2]=a[1]+a[2];d[3]=a[3];d[4]=a[1]+a[2]+a[3]+a[4];等等；这样

DescriptionWord puzzles are usually simple and very entertaining for all ages. They are so entertaining that Pizza-Hut company started using table covers with word puzzles printed on them, possi

解题思路：和前面一道

解题思路：线段树，点更新，求

解题思路：用线段树求逆序对。只需要

解题思路：题目大意是

DescriptionACM has bought a new crane (crane -- jeřáb) . The crane consists of n segments of various lengths, connected by flexible joints. The end of the i-th segment is joined to the beginning

解题思路：区间更新，区间求和的模板题。AC代码：

解题思路：用每个字符的下标记录

单点更新，区间求和：

DescriptionGiven a list of phone numbers, determine if it is consistent in the sense that no number is the prefix of another. Let’s say the phone catalogue listed these numbers:1. Emergency 911

解题思路：这题和之前的

本文主要介绍解决动态连通性一类问题的一种算法，使用到了一种叫做并查集的数据结构，称为Union-Find。更多的信息可以参考Algorithms 一书的Section 1.5，实际上本文也就是基于它的一篇读后感吧。原文中更多的是给出一些结论，我尝试给出一些思路上的过程，即为什么要使用这个方法，而不是别的什么方法。我觉得这个可能更加有意义一些，相比于记下一些结论。

DescriptionJapan plans to welcome the ACM ICPC World Finals and a lot of roads must be built for the venue. Japan is tall island with N cities on the East coast and M cities on the West coast (M

解题思路：题目一开始没看懂，读了半天才知道是一颗

解题思路：貌似

解题思路：完全就是二维树状数组的模板

DescriptionIn this problem, you have to analyze a particular sorting algorithm. The algorithm processes a sequence of n distinct integers by swapping two adjacent sequence elements until the seq

解题思路：最基础的树状数组，

解题思路：这题用字典树做可以，用map映射做也可以，当然字典树效率

解题思路：直接

DescriptionThe citizens of Bytetown, AB, could not stand that the candidates in the mayoral election campaign have been placing their electoral posters at all places at their whim. The city coun