LucienShui

链接:  http://acm.hdu.edu.cn/showproblem.php?pid=4557题目：Problem Description　　作为2013年699万应届毕业生中的一员，由于宏观经济的不景气，小明在毕业当天就华丽丽地失业了！ 　　经历了千难万苦的求职过程，小明特别能理解毕业生的就业之难，所以，他现在准备创建一家专门针对IT人才的求职中介公司——非诚勿扰人力资源开发有限公司。

链接： http://exam.upc.edu.cn/problem.php?id=5531 题目： 题目描述 Little Marica is making up a nonsensical unusual fairy tale and is telling to her grandfather who keeps interrupting her and asking her

链接:  http://codeforces.com/contest/842/problem/C题目：Ilya is very fond of graphs, especially trees. During his last trip to the forest Ilya found a very interesting tree rooted at vertex 1. There is an i

链接:  http://acm.hdu.edu.cn/showproblem.php?pid=1671题目：Problem 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

最近开始学数据结构，一直无心更新博客，今天结束集训，晚上打算码一下最近的进度。/* * 创建一个最大容量为MaxSize的int型堆：MaxHeap<int> que(MaxSize); * 默认最大容量为1007：MaxHeap<int> que; * * 作为优先队列： * pop(); 同优先队列pop()，如果队列已为空还要执行pop，就会执行死循环以报错。

template<typename T, typename _Compare=std::less<T> > class leftist_tree { private: struct node { T data; int deep; node *l, *r; node(const T &d) : data(d), deep(1),

指针版：template <class T, class Compare = std::less<T> > class Treap { private: struct treap {//成员结构体 int size, fix;//以当前节点为根的树的节点数目，和调整树结构的fix随机数 T key;//每个节点的权，可以定义成自己想要的类型 C

链接:  题目：DescriptionThe new founded Balkan Investment Group Bank (BIG-Bank) opened a new office in Bucharest, equipped with a modern computing environment provided by IBM Romania, and using modern infor

链接:  http://acm.hdu.edu.cn/showproblem.php?pid=4585题目：Problem DescriptionShaolin temple is very famous for its Kongfu monks.A lot of young men go to Shaolin temple every year, trying to be a monk there

链接:  http://poj.org/problem?id=1442题目：DescriptionOur Black Box represents a primitive database. It can save an integer array and has a special i variable. At the initial moment Black Box is empty and i

题解链接： https://lucien.ink/archives/124/ 题目链接： http://exam.upc.edu.cn/problem.php?id=5911 题目： 题目描述 一个n*m的方格，初始时每个格子有一个整数权值。接下来每次有2种操作： 改变一个格子的权值； 求一个子矩阵中某种特定权值出现的个数。 输入 第一行有两个数n,m。 接下...