ACM,再见！

http://hihocoder.com/problemset/problem/1232描述"Couple Trees" are two trees, a husband tree and a wife tree. They are named because they look like a couple leaning on each other. They share a

http://acm.hdu.edu.cn/showproblem.php?pid=2665Problem DescriptionGive you a sequence and ask you the kth big number of a inteval. InputThe first line is the number of the t

http://acm.hdu.edu.cn/showproblem.php?pid=4893

http://acdream.info/problem?pid=1019Problem DescriptionNow we have a long long string, and we will have two kinds of operation on it.C i y : change the ith letter to y.Q i j : check whet

http://acm.hdu.edu.cn/showproblem.php?pid=4747Problem DescriptionMex is a function on a set of integers, which is universally used for impartial game theorem. For a non-negative integer set

http://acm.hdu.edu.cn/showproblem.php?pid=4902

http://acm.hdu.edu.cn/showproblem.php?pid=4970Problem DescriptionKingdom Rush is a popular TD game, in which you should build some towers to protect your kingdom from monsters. And now anoth

http://acm.hdu.edu.cn/showproblem.php?pid=3973Problem DescriptionYou are given some words {Wi}. Then our stupid AC will give you a very long string S. AC is stupid and always wants to know w

http://acm.hdu.edu.cn/showproblem.php?pid=5380Problem DescriptionThere are n+1 cities on a line. They are labeled from city 0 to city n. Mph has to start his travel from city 0, passing city

http://acm.hdu.edu.cn/showproblem.php?pid=4638Problem DescriptionThere are n men ,every man has an ID(1..n).their ID is unique. Whose ID is i and i-1 are friends, Whose ID is i and i+1 are f

http://acm.hdu.edu.cn/showproblem.php?pid=5289Problem DescriptionTom owns a company and he is the boss. There are n staffs which are numbered from 1 to n in this company, and every staff has

http://acm.hdu.edu.cn/showproblem.php?pid=4123Problem DescriptionBob wants to hold a race to encourage people to do sports. He has got trouble in choosing the route. There are N houses and N

http://acm.hdu.edu.cn/showproblem.php?pid=4699Problem Description Sample Input8I 2I -1I 1Q 3LDRQ 2 Sample Output23HintThe following diagram shows t

http://poj.org/problem?id=1741DescriptionGive a tree with n vertices,each edge has a length(positive integer less than 1001). Define dist(u,v)=The min distance between node u and v. Give a

http://www.lydsy.com/JudgeOnline/problem.php?id=2243Description给定一棵有n个节点的无根树和m个操作，操作有2类：1、将节点a到节点b路径上所有点都染成颜色c；2、询问节点a到节点b路径上的颜色段数量（连续相同颜色被认为是同一段），如“112221”由3段组成：“11”、“222”和“1”。

http://acm.hdu.edu.cn/showproblem.php?pid=5195Problem DescriptionA topological sort or topological ordering of a directed graph is a linear ordering of its vertices such that for every d

http://acm.hdu.edu.cn/showproblem.php?pid=4339Problem DescriptionYou are given two strings s1[0..l1], s2[0..l2] and Q - number of queries.Your task is to answer next queries:  1) 1 a i c

http://codeforces.com/contest/589/problem/GG. Hiringtime limit per test4 secondsmemory limit per test512 megabytesinputstandard inputoutputstandard outp

http://codeforces.com/problemset/problem/6/E

http://acm.hdu.edu.cn/showproblem.php?pid=1698

http://acm.hdu.edu.cn/showproblem.php?pid=4267Problem DescriptionLet A1, A2, ... , AN be N elements. You need to deal with two kinds of operations. One type of operation is to add a give

http://acm.hdu.edu.cn/showproblem.php?pid=5489Removed IntervalTime Limit: 4000/2000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 656    Accepted Submissi

下图是对线段[1,10)建立的一棵线段树基本结构1.每个节点都是一个[a,b)的区间，根节点代表了整个所要处理的区间2. 对于每个非叶节点[a,b)，令mid = (a + b) / 2；则其左右儿子节点代表的区间为[a,mid)，[mid,b)3.二叉的组织结构4. 线段树是一个平衡树，树的高度为logN5. 线段树把区间上的任意一条长度为L的线段都分成不超过

Problem DescriptionC国的死对头A国这段时间正在进行军事演习，所以C国间谍头子Derek和他手下Tidy又开始忙乎了。A国在海岸线沿直线布置了N个工兵营地,Derek和Tidy的任务就是要监视这些工兵营地的活动情况。由于采取了某种先进的监测手段，所以每个工兵营地的人数C国都掌握的一清二楚,每个工兵营地的人数都有可能发生变动，可能增加或减少若干人手,但这些都逃不过C国的监视

http://acm.hdu.edu.cn/showproblem.php?pid=5023

http://acm.hdu.edu.cn/showproblem.php?pid=4288Problem Description　　In mathematics and computer science, an algorithm describes a set of procedures or instructions that define a procedure

http://poj.org/problem?id=2777

http://www.lightoj.com/volume_showproblem.php?problem=1080

http://poj.org/problem?id=3468

http://acm.hdu.edu.cn/showproblem.php?pid=5147Problem DescriptionLong long ago, there is a sequence A with length n. All numbers in this sequence is no smaller than 1 and no bigger than n, a

http://codeforces.com/problemset/problem/19/DDescriptionPete and Bob invented a new interesting game. Bob takes a sheet of paper and locates a Cartesian coordinate system on it as follows:

http://poj.org/problem?id=3237DescriptionYou are given a tree with N nodes. The tree’s nodes are numbered 1 through N and its edges are numbered 1 through N − 1. Each edge is associated with a

http://www.lydsy.com/JudgeOnline/problem.php?id=1036Description一棵树上有n个节点，编号分别为1到n，每个节点都有一个权值w。我们将以下面的形式来要求你对这棵树完成一些操作： I. CHANGE u t : 把结点u的权值改为t II. QMAX u v: 询问从点u到点v的路径上的节点的最大权值 III. QSUM u

http://acm.fzu.edu.cn/problem.php?pid=2082 Problem Description有n座城市，由n-1条路相连通，使得任意两座城市之间可达。每条路有过路费，要交过路费才能通过。每条路的过路费经常会更新，现问你，当前情况下，从城市a到城市b最少要花多少过路费。 Input有多组样例，每组样例第一行输入两个正整数n,m(2

http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=3148Problem KK Smallest SumsYou're given k arrays, each array has k integers. There are kk 

题目大意：有n个人，每个

http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=3146

http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=3142

https://icpcarchive.ecs.baylor.edu/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=1136

http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=2176