———各种dp优化
MissZhou要努力
不晓日月,不辩兰艾,终日碌碌,安与燕雀相随乎
展开
-
poj1180Batch Scheduling【斜率优化dp】
DescriptionThere is a sequence of N jobs to be processed on one machine. The jobs are numbered from 1 to N, so that the sequence is 1,2,..., N. The sequence of jobs must be partitioned into one or原创 2016-04-19 09:24:48 · 438 阅读 · 0 评论 -
Wannafly挑战赛7 codeJan与旅行
据说是CF div1的难度T^T 就只出了两个题,还是因为有一个是原题,昨天晚上做题居然又没想到dp滚动数组 dp啊 又爱又恨啊第一次WA50%因为最大值取小了https://www.nowcoder.com/acm/contest/56/B时间限制:C/C++ 1秒,其他语言2秒空间限制:C/C++ 262144K,其他语言524288K64bit IO Form原创 2018-01-06 10:03:01 · 512 阅读 · 2 评论 -
单调栈优化dp:hdu1506Largest Rectangle in a Histogram &hdu1505city game dp
其实早在去年九月就做过这两个题了hdu1506Largest Rectangle in a Histogramhdu1505city game dp然而并不是用单调栈来优化的,一个很不好理解的方法做的,要是让我再写一遍估计还是一脸懵逼QAQ直到昨天晚上看了小岛的直播虽说讲的实在太快,但是单调栈这玩意貌似真得好好学学先通过讲第一题说明单调栈的维护:看示例数组:原创 2016-08-10 12:55:10 · 1261 阅读 · 0 评论 -
leetcode402. Remove K Digits【单调栈变形】
Given a non-negative integer num represented as a string, remove k digits from the number so that the new number is the smallest possible.Note:The length of num is less than 10002 and will be原创 2017-05-29 08:54:03 · 1992 阅读 · 0 评论 -
hdu3530Subsequence【单调队列优化dp】2010多校联合
Problem DescriptionThere is a sequence of integers. Your task is to find the longest subsequence that satisfies the following condition: the difference between the maximum element and the minimum el原创 2016-02-23 21:57:17 · 1592 阅读 · 0 评论 -
Gym 101102D Rectangles 【单调栈】
Descriptionstandard input/outputGiven an R×C grid with each cell containing an integer, find the number of subrectangles in this grid that contain only one distinct integer; this means every c原创 2016-10-04 11:03:32 · 741 阅读 · 0 评论 -
hdu5890Eighty seven【bitset优化01背包】
Eighty sevenTime Limit: 3000/1000 MS (Java/Others) Memory Limit: 102400/102400 K (Java/Others)Total Submission(s): 583 Accepted Submission(s): 208Problem DescriptionMr. Fib is a math原创 2016-09-21 10:09:00 · 1004 阅读 · 0 评论 -
FZU - 1894选拔志愿者【单调队列】
Description世博会马上就要开幕了,福州大学组织了一次志愿者选拔活动。 参加志愿者选拔的同学们排队接受面试官们的面试。参加面试的同学们按照先来先面试并且先结束的原则接受面试官们的考查。 面试中每个人的人品是主要考查对象之一。(提高人品的方法有扶老奶奶过街,不闯红灯等) 作为主面试官的John想知道当前正在接受面试的同学队伍中人品值最高的是多少。于是他请你帮忙编写一个程序来计原创 2016-02-23 10:38:49 · 763 阅读 · 0 评论 -
poj2823Sliding Window【单调队列经典题】leetcode239. Sliding Window Maximum【python刷题】
DescriptionAn array of size n ≤ 106 is given to you. There is a sliding window of sizek which is moving from the very left of the array to the very right. You can only see thek numbers in the wi原创 2016-02-23 11:09:11 · 794 阅读 · 0 评论 -
hdu3401trade【单调队列优化dp】
Problem DescriptionRecently, lxhgww is addicted to stock, he finds some regular patterns after a few days' study.He forecasts the next T days' stock market. On the i'th day, you can buy one stock原创 2016-02-23 16:35:30 · 850 阅读 · 0 评论 -
poj1742coins【单调队列优化多重背包】楼教主八题
早上好不容易想明白,就是不知道自己哪里错了==我的错的/***************poj17422016.2.24不知道哪里错了啊啊啊啊啊***************/#include #include#includeusing namespace std;int n,m,c[102],a[102],q[102];bool dp[100006];int mai原创 2016-02-24 09:53:06 · 624 阅读 · 1 评论 -
hdu3507Print Article【斜率优化入门题】
Problem DescriptionZero has an old printer that doesn't work well sometimes. As it is antique, he still like to use it to print articles. But it is too old to work for a long time and it will certai原创 2016-02-24 14:29:42 · 558 阅读 · 0 评论 -
nefu1130Attack monsters【平行四边形优化石子合并】
//题中明确说了给定的不一定是有序的!! #include #include #include #include using namespace std; const int INF = 1 << 30; const int N = 1005; int dp[N][N]; int p[N][N]; int s原创 2016-04-21 17:09:17 · 513 阅读 · 0 评论 -
lintcode 168. 吹气球【记忆化搜索+区间dp】
168.吹气球中文English有n个气球,编号为0到n-1,每个气球都有一个分数,存在nums数组中。每次吹气球i可以得到的分数为nums[left] * nums[i] * nums[right],left和right分别表示i气球相邻的两个气球。当i气球被吹爆后,其左右两气球即为相邻。要求吹爆所有气球,得到最多的分数。样例样例 1:输入:[4, 1, 5, 10]...原创 2019-09-01 12:20:24 · 228 阅读 · 0 评论