动态规划
文章平均质量分 84
dp-动态规划
Dream Flying Eagle
这个作者很懒,什么都没留下…
展开
-
棋盘问题 dp-动态规划
棋盘问题 dp-动态规划Time limit:1000 msMemory limit:10000 kBSource: 蔡错@pkuhttp://poj.org/searchproblem?field=source&key=%E8%94%A1%E9%94%99%40pku描述在一个给定形状的棋盘(形状可能是不规则的)上面摆放棋子,棋子没有区别。要求摆放时任意的两个...原创 2019-03-28 21:12:13 · 1017 阅读 · 0 评论 -
2021牛客寒假算法基础集训营6部分题解(A,C,D,E,F,G,H,I,J)
oj: 牛客A 回文括号序列计数oj: 牛客题意询问长度为 nnn 的括号序列的个数。括号序列定义:空串是括号序列。两个括号序列 PPP 和 QQQ 的拼接是括号序列。如果 PPP 是括号序列,’(’+ PPP +’)'是括号序列。题解脑筋急转弯题。一个长度不为0的括号序列的两端字符必定不同,所以左右反转后一定不是括号序列,更不可能与之前相同。代码#include <bits/stdc++.h>#define _for(i, a) for (int i = 0,原创 2021-02-25 11:07:20 · 389 阅读 · 0 评论 -
2020 年第一届辽宁省大学生程序设计竞赛(A,B,C,E,F,G,H,I,J,K)
oj: 牛客A.组队分配(签到题)oj: 牛客题解排序后直接输出。代码#pragma GCC optimize(2)#include <bits/stdc++.h>#define _for(i, a) for(int i = 0, lennn = (a); i < lennn; ++i)#define _rep(i, a, b) for(int i = (a), lennn = (b); i <= lennn; ++i)using namespace st.原创 2021-01-30 19:39:09 · 1503 阅读 · 1 评论 -
Educational Codeforces Round 103 (Rated for Div. 2)部分题解(A,B,C,D)
oj: CodeForces叙述采用倒叙D. Journey(dp)oj: CodeForces题意有 n+1n+1n+1 个点和 nnn 条边组成的一条链,链上的边只能由一个朝向(向左或者向右)。有个旅行者从一个点出发后只能顺着边的朝向移动,不过每当他移动一格,所有边的朝向都会改变(朝左的百年城朝右,朝右的变成朝左)。求出旅行者分别在每一个点出发能够走到的最多的点数。题解定义 dp[i][j][k]dp[i][j][k]dp[i][j][k] :当 iii 为 000 时表示只.原创 2021-01-30 14:38:38 · 272 阅读 · 3 评论 -
2020杭电多校第10场题解
Time limit: 6000 msMemory limit: 262144 kBJudge:VJudgeHDUOJProblem DescriptionFor a given permutation a1,a2,⋯,ana1,a2,⋯,ana1,a2,⋯,an of length nnn, we defined the neighbor sequence bbb of aaa, the length of which is n−1n−1n−1, as following:y = \le.原创 2020-11-02 20:44:35 · 462 阅读 · 0 评论 -
点对最大值(“科林明伦杯”哈尔滨理工大学第十届程序设计竞赛-A)(树形dp、动态规划)
时间限制:C/C++ 1秒,其他语言2秒空间限制:C/C++ 131072K,其他语言262144K64bit IO Format: %lldOJ: 牛客题目描述这里有一棵树,每个点和每条边都存在一个价值。对于树上点对的价值,包括点对的起点和终点以及路径上边权值之和,不包括路径上其他点值。求这颗树上最大的点对价值为多少。点对至少需要两个点。输入描述:输入ttt,代表有ttt组样例。每组样例第一行输入nnn,代表有nnn个点。接下来有n−1n-1n−1行,第iii行有a[i]和b[i],代.原创 2020-10-28 13:17:26 · 189 阅读 · 0 评论 -
免费馅饼(动态规划)
免费馅饼(动态规划)Time limit1000 msMemory limit32768 kBOSWindowsjudge:VJudgeDescription都说天上不会掉馅饼,但有一天gameboy正走在回家的小径上,忽然天上掉下大把大把的馅饼。说来gameboy的人品实在是太好了,这馅饼别处都不掉,就掉落在他身旁的10米范围内。馅饼如果掉在了地上当然就不能吃了,所以gameboy马上卸下身上的背包去接。但由于小径两侧都不能站人,所以他只能在小径上接。由于gameboy平时老呆在房间里玩游原创 2020-08-19 12:02:57 · 278 阅读 · 0 评论 -
E Two Matchings(2020牛客暑期多校训练营(第三场))(动态规划+找规律)
E Two Matchings(2020牛客暑期多校训练营(第三场))(动态规划+找规律)时间限制:C/C++ 1秒,其他语言2秒空间限制:C/C++ 262144K,其他语言524288K64bit IO Format: %lldjudge:牛客题库题目描述A permutation of length n is an array p=[p1,p2,…,pn]p=[p_1, p_2, \ldots, p_n]p=[p1,p2,…,pn], which contains every int原创 2020-07-19 12:14:00 · 337 阅读 · 0 评论 -
D - The Moon(2018CCPC吉林赛区)(概率dp)
D - The Moon(2018CCPC吉林赛区)(概率dp)Time limit:1000 msMemory limit:262144 kBSpecial judge:Yesjudge:HDU 6558vjudgeDescriptionThe Moon card shows a large, full moon in the night’s sky, positioned be...原创 2020-04-11 17:39:13 · 271 阅读 · 0 评论 -
Codeforces Round #620 (Div. 2)(D. Shortest and Longest LIS)(O(n log n)的最长上升子序列或者贪心)
Codeforces Round #620 (Div. 2)(D. Shortest and Longest LIS)(O(n log n)的最长上升子序列或者贪心)time limit per test3 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputjudge:点我跳...原创 2020-02-16 11:22:16 · 497 阅读 · 1 评论 -
2020牛客寒假算法基础集训营5(F 碎碎念)(dp-动态规划)
2020牛客寒假算法基础集训营5(F 碎碎念)(dp-动态规划)时间限制:C/C++ 1秒,其他语言2秒空间限制:C/C++ 262144K,其他语言524288K64bit IO Format: %lldjudge: 点我跳转题目描述在ACM比赛里,除了CE以外都是有效的提交。每一个提交都会有其评测的结果,或是AC,或是RJ(Rejected,包含各种不通过的情况)。往往一个人上...原创 2020-02-14 16:44:57 · 206 阅读 · 0 评论 -
CF895C Square Subsets(状压dp)
CF895C Square Subsets(状压dp)时间限制4.00s内存限制250.00MBjudge:点我跳转题目描述Petya was late for the lesson too. The teacher gave him an additional task. For some array a a Petya should find the number of di...原创 2020-02-02 10:28:25 · 306 阅读 · 0 评论 -
E. Antenna Coverage(Codeforces Round #600 (Div. 2))(dp-贪心)
E. Antenna Coverage(Codeforces Round #600 (Div. 2))(dp-贪心)题意有 nnn 个天线,每个天线有一定的半径可以覆盖一位数轴上的某段区域。现在你可以执行一个操作使某个天线的覆盖半径增加 111 ,你可以执行任意次这样的操作。现在问你最少执行多少次可以覆盖从 1−m1-m1−m 的所有区域?题解请结合代码注释进行理解代码#incl...原创 2019-11-17 23:09:40 · 706 阅读 · 0 评论 -
E. Yet Another Division Into Teams(Codeforces Round #598 (Div. 3))(划分数-贪心-模拟)
E. Yet Another Division Into Teams(Codeforces Round #598 (Div. 3))(划分数-贪心-模拟)time limit per test:2 secondsmemory limit per test:256 megabytesinput:standard inputoutput:standard outputDescriptio...原创 2019-11-07 23:29:55 · 251 阅读 · 0 评论 -
Ivan the Fool and the Probability Theory-Codeforces Round #594 (Div. 2)-C题(dp+思维)
Ivan the Fool and the Probability Theory-Codeforces Round #594 (Div. 2)-C题(dp+思维)time limit per test:1 secondmemory limit per test:512 megabytesinput:standard inputoutput:standard output描述Rece...原创 2019-10-21 00:28:43 · 675 阅读 · 7 评论 -
Beautiful numbers dp-动态规划
Beautiful numbers dp-动态规划Time limit:4000 msMemory limit:262144 kBSource: Codeforces Beta Round #51描述Volodya is an odd boy and his taste is strange as well. It seems to him that a positive...原创 2019-03-28 21:07:31 · 148 阅读 · 0 评论 -
铺砖问题
铺砖问题给定n∗mn*mn∗m的格子,每个格子被染成黑色或白色。现在要用1∗21*21∗2的砖块覆盖这些格子,要求块与块之间互相不重叠,且覆盖了所有的白色的格子,但不覆盖任意一个黑色格子。求一共有多少种覆盖方法,输出方案数对MMM取余后的结果。(1≤n≤15,1≤m≤5,2≤M≤109)(1\leq n\leq 15,1\leq m\leq 5,2\leq M\leq 10^{9})(1≤n≤...原创 2019-10-01 17:07:16 · 512 阅读 · 0 评论 -
Mondriaan's Dream(状压dp)
Mondriaan’s Dream(状压dp)Time Limit: 3000MS Memory Limit: 65536Kjudge:poj 2411source:Ulm Local 2000DescriptionSquares and rectangles fascinated the famous Dutch painter Piet Mondriaan. One nigh...原创 2019-10-04 23:12:37 · 225 阅读 · 0 评论 -
Blocks(POJ No.3734)
Blocks(POJ No.3734)给定NNN个方块排成一列。现在要用红、蓝、绿、黄四种颜色的油漆给这些方块染色。求染成红色的方块和染成绿色的方块的个数同时为偶数的染色方案的个数,输出对10007取余后的答案。(1≤N≤109)(1\leq N \leq 10^{9})(1≤N≤109)输入N = 1N = 2输出26题解让我们试着从左边开始依次染色。设染到第iii个方块...原创 2019-10-05 22:48:21 · 304 阅读 · 0 评论 -
图中长度为k的路径的计数
图中长度为k的路径的计数给定一个nnn个顶点,边长为111的有向图的邻接矩阵。求出这个图里长度为kkk的路径的总数。路径中同一条边允许通过多次。(1≤n≤100,1≤109)(1 \leq n \leq 100,1\leq10^9)(1≤n≤100,1≤109)输入n = 4k = 2输出6题解假设从uuu出发,到vvv的路径的总数为Gk[u][v]G_k[u][v]Gk[...原创 2019-10-06 11:36:48 · 1483 阅读 · 2 评论 -
Minimizing Maximizer(POJ No.1769)
Minimizing Maximizer(POJ No.1769)Maximizer是一个接受 nnn 个数作为输入,并输出它们的最大值的装置。这个装置由 mmm 个叫做Sorter的装置依次连接而成。第 kkk 个Sorter把第 k−1k-1k−1 个Sorter的输出作为输入,然后将第 sks_ksk 到第 tkt_ktk 个值进行排序后,保持其余部分不变输出。Maximizer的输入...原创 2019-10-08 15:03:35 · 309 阅读 · 0 评论 -
有关计数问题的DP
有关计数问题的DP划分数题目:放苹果_牛客网描述有nnn个无区别的物品,将它们划分成不超过mmm组,求出划分方法数模MMM的余数。(1<=m<=n<=1000,2<=M<=10000)(1<=m<=n<=1000, 2<=M<=10000)(1<=m<=n<=1000,2<=M<=10000)输入...原创 2019-09-29 22:50:06 · 528 阅读 · 1 评论 -
Race to 1 Again(概率+dp动态规划)
Race to 1 Again(概率+dp动态规划)judge:LightOJ 1038vjudge:VJudgeTime limit 2000 msMemory limit 32768 kBOS Linux描述Rimi learned a new thing about integers, which is - any positive integer great...原创 2019-08-16 10:17:47 · 365 阅读 · 0 评论 -
Common Subsequence(最长公共子序列-LCS-简单模板题)
Common Subsequence(最长公共子序列-LCS-简单模板题)source:POJ 1458Time Limit: 1000MS Memory Limit: 10000K描述AAA subsequence of a given sequence is the given sequence with some elements (possible none) left out...原创 2019-07-25 20:03:43 · 229 阅读 · 0 评论 -
动态规划-最长上升(下降)子序列的O(n logn)写法(基于二分)
动态规划-最长上升(下降)子序列的O(n logn)写法(基于二分)常规最长上升(下降)子序列的时间复杂度是O(nO(nO(n2)))。优化后可以更快:基于贪心的策略,维护一个队列dpdpdp,使内部的元素为有序排列,长度即为最长上升(下降)子序列的长度。初始队列为空,依次枚举aaa数组(即原始序列),判断是否大于(或等于)队首元素,若大于则直接压入队列,新队列依然是有序队列;若小于队首元...原创 2019-07-25 17:33:22 · 301 阅读 · 0 评论 -
Bone Collector II(动态规划-01背包-第K优解)
Bone Collector II(动态规划-01背包-第K优解)source:hduoj 2639Time Limit: 5000/2000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)描述The title of this problem is familiar,isn’t it?yeah,if you had t...原创 2019-07-25 16:04:39 · 263 阅读 · 0 评论 -
Bone Collector(动态规划-dp-01背包裸题)
Bone Collector(动态规划-dp-01背包裸题)描述Many years ago , in Teddy’s hometown there was a man who was called “Bone Collector”. This man like to collect varies of bones , such as dog’s , cow’s , also he went ...原创 2019-07-25 15:34:29 · 210 阅读 · 0 评论 -
Communication System dp-动态规划
Communication System dp-动态规划Time limit:1000 msMemory limit:10000 kBSource: Tehran 2002, First Iran Nationwide Internet Programming Contest描述We have received an order from Pizoor Communica...原创 2019-03-28 21:03:17 · 260 阅读 · 0 评论 -
Monkey and Banana dp-动态规划
Monkey and Banana dp-动态规划Time limit:1000 msMemory limit:32768 kBSource: University of Ulm Local Contest 1996描述A group of researchers are designing an experiment to test the IQ of a monkey...原创 2019-03-28 21:01:20 · 176 阅读 · 0 评论 -
To the Max dp-动态规划
To the Max dp-动态规划Time limit:1000 msMemory limit:10000 kBSource: Greater New York 2001描述Given a two-dimensional array of positive and negative integers, a sub-rectangle is any contiguous ...原创 2019-03-28 20:57:55 · 150 阅读 · 0 评论 -
ZZNUOJ 2107 : 山区修路 -河南省第十一届ACM省赛
ZZNUOJ 2107 : 山区修路 -河南省第十一届ACM省赛时间限制:3 Sec 内存限制:128 MiB题目描述*SNJ位于HB省西部一片群峰耸立的高大山地,横亘于A江、B水之间,方圆数千平方公里,相传上古的神医在此搭架上山采药而得名。景区山峰均在海拔3000米以上,堪称"华中屋脊"。SNJ是以秀绿的亚高山自然风光,多样的动植物种,人与自然和谐共存为主题的森林生态区。SNJ处于中国地...原创 2019-04-10 13:48:55 · 397 阅读 · 0 评论 -
Anniversary party(动态规划-树形dp)
Anniversary party(动态规划-树形dp)judge:POJ 2342Time Limit: 1000MS Memory Limit: 65536Ksource:Ural State University Internal Contest October’2000 Students SessionDescriptionThere is going to be a par...原创 2019-08-04 13:55:53 · 215 阅读 · 0 评论 -
Monkey Party(动态规划-区间dp-四边形不等式优化)
Monkey Party(动态规划-区间dp-四边形不等式优化)judge:HDUOJ 3506Time Limit: 4000/2000 MS (Java/Others)Memory Limit: 131072/65536 K (Java/Others)source:2010 ACM-ICPC Multi-University Training Contest(7)——Host by H...原创 2019-08-04 13:34:35 · 266 阅读 · 0 评论 -
Multiplication Puzzle(POJ - 1651)(动态规划-区间dp)
Multiplication Puzzle(POJ - 1651)(动态规划-区间dp)judge:POJ 1651Time Limit: 1000MS Memory Limit: 65536Ksource:Northeastern Europe 2001, Far-Eastern SubregionDescriptionThe multiplication puzzle is pl...原创 2019-08-04 13:08:13 · 332 阅读 · 0 评论 -
Discovering Gold(概率,dp动态规划)
Discovering Gold(概率,dp动态规划)judge:Light OJ 1030Time limit:2000 msMemory limit:32768 kBOS:Linux描述You are in a cave, a long cave! The cave can be represented by a 1 x N grid. Each cell of the cave ...原创 2019-08-15 19:50:57 · 438 阅读 · 0 评论 -
动态规划-最长上升(下降)子序列的O(n logn)写法(基于树状数组)
动态规划-最长上升(下降)子序列的O(n logn)写法(基于树状数组)常规最长上升(下降)子序列的时间复杂度是O(n2)O(n^2)O(n2)。优化后可以达到O(nlogn)O(n logn)O(nlogn)一般思维是遍历数组,每次枚举找出前面比它小的元素对应的最长上升子序列的最大长度,而树状数组正是在这一步优化速度的。那么如何利用树状数组加速呢?先复制一份数组,然后排序并剔除相同元素...原创 2019-07-27 21:20:41 · 766 阅读 · 1 评论 -
Advanced Fruits(LCS最长公共子序列+记录路径+最短公共父序列)
Advanced Fruits(LCS最长公共子序列+记录路径+最短公共父序列)描述The company “21st Century Fruits” has specialized in creating new sorts of fruits by transferring genes from one fruit into the genome of another one. Most ...原创 2019-07-28 10:06:59 · 1326 阅读 · 0 评论 -
Compromise(LCS最长公共子序列+记录路径)
Compromise(LCS最长公共子序列+记录路径)source:POJ 2250Time limit:1000 msMemory limit:65536 kBSpecial judge:YesOS:Linux描述In a few months the European Currency Union will become a reality. However, to join t...原创 2019-07-28 09:44:37 · 222 阅读 · 0 评论 -
Cutting Sticks(动态规划-区间dp)
Cutting Sticks(动态规划-区间dp)judge:scuoj 1702Time limit:3000 msOS:LinuxDescriptionYou have to cut a wood stick into pieces. The most affordable company, The Analog Cutting Machinery, Inc. (ACM), char...原创 2019-07-31 23:49:30 · 359 阅读 · 0 评论 -
Brackets(动态规划-区间dp)
Brackets(动态规划-区间dp)judge:poj 2955source:Stanford Local 2004Time Limit: 1000MSMemory Limit: 65536KTotal Submissions: 15405Accepted: 8061DescriptionWe give the following inductive definition of a ...原创 2019-07-31 23:36:43 · 235 阅读 · 1 评论