![](https://img-blog.csdnimg.cn/20201014180756780.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
STL
hncu__lz
既然坚持了这么久,就要坚持到最后~
展开
-
hdu1702 ACboy needs your help again!(栈和队列
Problem Description ACboy was kidnapped!! he miss his mother very much and is very scare now.You can't image how dark the room he was put into is, so poor :(. As a smart ACMer, you want to get ACb原创 2016-09-18 21:17:02 · 190 阅读 · 0 评论 -
hdu 1022 Train Problem I(栈)
Problem Description As the new term comes, the Ignatius Train Station is very busy nowadays. A lot of student want to get back to school by train(because the trains in the Ignatius Train Station is t原创 2016-09-18 22:51:53 · 172 阅读 · 0 评论 -
双向队列的使用
Deque是一种优化了的、对序列两端元素进行添加和删除操作的基本序列容器。它允许较为快速地随机访问,但它不像vector 把所有的对象保存在一块连续的内存 块,而是采用多个连续的存储块,并且在一个映射结构中保存对这些块及其顺序的跟踪。向deque 两端添加或删除元素的开销很小。它不需要重新分配空间,所以向末端增加元素比vector 更有效。 实际上,deque 是对vecto转载 2016-09-19 14:21:03 · 3730 阅读 · 0 评论 -
hdu 3415 Max Sum of Max-K-sub-sequence(单调队列)
Problem Description Given a circle sequence A[1],A[2],A[3]......A[n]. Circle sequence means the left neighbour of A[1] is A[n] , and the right neighbour of A[n] is A[1]. Now your job is to calculate原创 2016-09-19 21:50:55 · 218 阅读 · 0 评论 -
poj 1363 Rails(栈)
Description There is a famous railway station in PopPush City. Country there is incredibly hilly. The station was built in last century. Unfortunately, funds were extremely limited that time. It wa原创 2016-09-19 22:22:58 · 394 阅读 · 0 评论