CYCKCN的博客

树状数组

## 线段树 ## ，

树链剖分的原理简介 考试时遇到的几个树链剖分 数据结构练习T4 SPOJ375 QTREE修铁路 几道树链剖分的练习 BZOJ 1036 ZJOI2008树的统计树链剖分的原理简介

POJ 2485 Highways Description The island nation of Flatopia is perfectly flat. Unfortunately, Flatopia has no public highways. So the traffic is difficult in Flatopia. The Flatopian government

POJ 1679 The Unique MST Description Given a connected undirected graph, tell if its minimum spanning tree is unique. Definition 1 (Spanning Tree): Consider a connected, undirected graph G = (V,

CJOJ 2403 次小生成树 Description 小 C 最近学了很多最小生成树的算法，Prim 算法、Kurskal 算法、消圈算法等等。 正当小 C 洋洋得意之时，小 P 又来泼小 C 冷水了。小 P 说，让小 C 求出一个无向图的次小生成树，而且这个次小生成树还得是严格次小的，也就是说： 如果最小生成树选择的边集是 EM，严格次小生成树选择的边集是 ES，那么需要满足：(v

POJ 2152 Fire Description Country Z has N cities, which are numbered from 1 to N. Cities are connected by highways, and there is exact one path between two different cities. Recently country Z oft

HDU 2121 Ice_cream’s world II Problem Description After awarded lands to ACMers, the queen want to choose a city be her capital. This is an important event in ice_cream world, and it also a ve

POJ 3164 Command Network Description After a long lasting war on words, a war on arms finally breaks out between littleken’s and KnuthOcean’s kingdoms. A sudden and violent assault by KnuthOcean

POJ 3659 Cell Phone Network Description Farmer John has decided to give each of his cows a cell phone in hopes to encourage their social interaction. This, however, requires him to set up cell

大话西游 Description “大话西游” 是一个在中国非常流行的在线游戏， 由 NIE 公司开发和维护。 这个游戏来源于著名的小说《西游记》 和周星弛的电影， 游戏的背景故事充满奇幻色彩， 引人入胜。 游戏里面有很多片区域， 不同的区域由不同的统治者管辖， 其中有一个地方名叫“树国”，由一个妖怪控制着。 这里有 N 个城堡， 每个城堡都有其重要程度值（一个正整数， 不超

POJ 3398 Perfect Service Description A network is composed of N computers connected by N − 1 communication links such that any two computers can be communicated via a unique route. Two computer

HDU 1301 Jungle Roads Problem Description The Head Elder of the tropical island of Lagrishan has a problem. A burst of foreign aid money was spent on extra roads between villages some ye

简单的数列 Description 一个简单的数列问题： 给定一个长度为n的数列，求这样的三个元素 ai,aj,ak 的个数，满足 ai＜aj>ak，且 i＜j＜k 。 Input 第1行是一个整数n（1 接下来n行，每行一个元素ai（0 Output 一个数，满足 ai＜aj>ak (i＜j＜k) 的个数。