单调队列
AcceptedQWQ
一直在前进
展开
-
dp单调队列(详解)
我们从最简单的问题开始:给定一个长度为N的整数数列a(i),i=0,1,...,N-1和窗长度k.要求: f(i) = max{a(i-k+1),a(i-k+2),..., a(i)},i = 0,1,...,N-1问题的另一种描述就是用一个长度为k的窗在整数数列上移动,求窗里面所包含的数的最大值。解法一:很直观的一种解法,那就是从数列的开头,将窗放上去,然后找到转载 2017-07-22 11:41:22 · 617 阅读 · 0 评论 -
HDU-5289(单调队列)
Tom 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 a ability. Now, Tom is going to assign a special task to some staffs who w转载 2017-07-22 12:34:07 · 305 阅读 · 0 评论 -
B. Minimize the error(优先队列?)
B. Minimize the errortime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputYou are given two arrays A and B, each of size n. The error, E, between these ...原创 2018-05-08 20:30:07 · 342 阅读 · 0 评论