动态规划
文章平均质量分 85
Whowell
欢迎自荐或推荐实习/校招(字节)!
加油,加油,朝着自己的梦想!!!!!
展开
-
Chernobyl’ Eagle on a Roof URAL - 1223[递推dp]
题目:有n个鸡蛋,m层的楼房,假设所有鸡蛋的坚硬程度都是一样的,要做实验确定楼层E,在楼层E扔下一个鸡蛋鸡蛋没碎,在E+1或者更高的楼层扔下一个鸡蛋,鸡蛋就会碎,假设一个鸡蛋没有碎,就会用到下一次实验,求最坏情况下的最少实验次数,就能确定E的; 题解:最坏情况下的最小值,表示有个鸡蛋,层楼的最坏情况下的最少实验次数,状态转移方程如下:具体解释:枚举楼层,如果实验鸡蛋碎了,那么就用...原创 2018-09-29 16:26:41 · 367 阅读 · 0 评论 -
Mnemonics and Palindromes URAL - 1635 [区间dp]
1635. Mnemonics and PalindromesTime limit: 1.0 secondMemory limit: 64 MBThe student Vasechkin was terribly unlucky at his oral examination. Of 42 examination questions, he didn't prepare only the last...原创 2018-05-23 22:28:04 · 273 阅读 · 0 评论 -
POJ - 2955 Brackets [区间dp]
Language:DefaultBracketsTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 11144 Accepted: 5915DescriptionWe give the following inductive definition of a “regular brackets” sequence:the empty s...原创 2018-05-23 20:49:53 · 119 阅读 · 0 评论 -
南阳理工 737 石子合并(一)[区间dp]
石子合并(一)时间限制:1000 ms | 内存限制:65535 KB难度:3描述 有N堆石子排成一排,每堆石子有一定的数量。现要将N堆石子并成为一堆。合并的过程只能每次将相邻的两堆石子堆成一堆,每次合并花费的代价为这两堆石子的和,经过N-1次合并后成为一堆。求出总的代价最小值。输入有多组测试数据,输入到文件结束。每组测试数据第一行有一个整数n,表示有n堆石子。接下来的一行有n(0<...原创 2018-05-23 20:45:28 · 151 阅读 · 0 评论 -
区间dp入门
区间dp原创 2018-05-23 20:50:21 · 172 阅读 · 0 评论 -
Codeforces 981 D. Bookshelves [dp + 贪心]
D. Bookshelvestime limit per test:1 secondmemory limit per test:256 megabytesinput:standard inputoutput:standard outputMr Keks is a typical white-collar in Byteland.He has a bookshelf in his office wi...原创 2018-05-28 15:53:47 · 441 阅读 · 0 评论 -
False Mirrors URAL - 1152 [状压dp + dfs记忆搜索]
1152. False MirrorsTime limit: 2.0 secondMemory limit: 64 MBBackgroundWe wandered in the labyrinth for twenty minutes before finally entering the large hall. The walls were covered by mirrors here as ...原创 2018-05-16 21:34:32 · 206 阅读 · 0 评论 -
Binary Lexicographic Sequence URAL - 1081
1081. Binary Lexicographic SequenceTime limit: 0.5 secondMemory limit: 64 MBConsider all the sequences with length (0 < N < 44), containing only the elements 0 and 1, and no two ones are adjacen...原创 2018-05-27 00:46:54 · 122 阅读 · 0 评论 -
Codeforces Round #483 [Thanks, Botan Investments and Victor Shaburov!] Editoral
T1:A. Gametime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputTwo players play a game.Initially there are nn integers a1,a2,…,ana1,a2,…,an written on ...原创 2018-05-16 16:31:40 · 344 阅读 · 0 评论 -
Sum of Digits URAL - 1658 [数位dp+递推dp]
1658. Sum of DigitsTime limit: 2.0 secondMemory limit: 64 MBPetka thought of a positive integer n and reported to Chapaev the sum of its digits and the sum of its squared digits. Chapaev scratched his...原创 2018-05-26 20:22:02 · 325 阅读 · 0 评论 -
K-based Numbers. Version 2 URAL - 1012 [dp + java大数]
1012. K-based Numbers. Version 2Time limit: 0.5 secondMemory limit: 16 MBLet’s consider K-based numbers, containing exactly N digits. We define a number to be valid if its K-based notation doesn’t con...原创 2018-05-15 20:57:28 · 217 阅读 · 0 评论 -
K-based Numbers. Version 3 URAL - 1013 [递推+矩阵快速幂]
1013. K-based Numbers. Version 3Time limit: 0.5 secondMemory limit: 64 MBLet’s consider K-based numbers, containing exactly N digits. We define a number to be valid if its K-based notation doesn’t con...原创 2018-05-26 10:30:31 · 261 阅读 · 0 评论 -
阿汤的数组
阿汤的数组题目描述 阿汤同学为了准备下学期的 ACM-ICPC,刷了很多的题目,他觉得自己已经比较厉害了,于是想出个题目考考你。现在他给你一个数组 A,问你是否能将该数组划分成数组 B、C 使得 B 数组的平均数和C 数组的平均数相等,数组 B 和 C 都不能为空。输入描述:从标准输入读入数据。输入包含多组数据,第一行一个整数 T 代表数据组数。接下来依次描述每组数据,对于每组数据:第一行输入...原创 2018-05-21 15:52:06 · 164 阅读 · 0 评论 -
The Debut Album URAL - 2018[滚动数组递推DP]
2018. The Debut AlbumTime limit: 2.0 secondMemory limit: 64 MBPop-group “Pink elephant” entered on recording their debut album. In fact they have only two songs: “My love” and “I miss you”, but each o...原创 2018-05-08 12:37:36 · 137 阅读 · 0 评论 -
URAL 1009. K-based Numbers [递推DP]
1009. K-based NumbersTime limit: 0.5 secondMemory limit: 64 MBLet’s consider K-based numbers, containing exactly N digits. We define a number to be valid if its K-based notation doesn’t contain two su...原创 2018-05-08 10:16:05 · 197 阅读 · 0 评论 -
Gentlemen URAL - 1244 [ 01背包 + 记录路径]
1244. GentlemenTime limit: 0.5 secondMemory limit: 64 MBLet's remember one old joke:Once a gentleman said to another gentleman:— What if we play cards?— You know, I haven't played cards for ten years…...原创 2018-05-28 21:55:09 · 223 阅读 · 0 评论 -
Communication Fiend URAL - 1741 [递推dp/最短路SPFA]
1741. Communication FiendTime limit: 1.0 secondMemory limit: 64 MBKolya has returned from a summer camp and now he's a real communication fiend. He spends all his free time on the Web chatting with hi...原创 2018-05-29 16:13:14 · 204 阅读 · 0 评论 -
牛客网暑期ACM多校训练营(第三场)A PACM Team [多维背包]
A PACM Team 题目:有n个物品属性(p,a,c,m,g),其中g是获得的利润,然后总容量是P,A,C,M,求最大的收益。思路:就是01背包,但是会爆内存,建议用short......没写出来还是对背包理解不行,好好看一下吧代码:#include<bits/stdc++...原创 2018-08-29 15:57:41 · 260 阅读 · 0 评论 -
“浪潮杯”山东省第九届ACM大学生程序设计竞赛 G - Games [dp + 背包优化]
G - Games题意:给定n个数字,求从中拿至多d个数子,异或和为x的方法数。题解:计算方案数,应该想到是计数dp的...... 状态:表示从前个数字中取个数字的异或和为的方案数。 状态转移方程: 空间复杂度是太大...原创 2018-08-28 13:35:05 · 293 阅读 · 6 评论 -
牛客网暑期ACM多校训练营(第二场)A run [简单计数dp]
A run题目:云秒钟可以走1米或者跑k米,但是不能连续两秒钟或者多秒钟跑k米,问走到区间的不同的方案数。思路:简单的计数dp,下面是有关dp的状态以及状态转移方程,状态:dp[i][j]表示第i米是通过走1米还是走k米得到的方案数;状态转移方程: dp[i+1][0] +...原创 2018-08-22 11:03:34 · 201 阅读 · 0 评论 -
2018 ccpc camp day 1 E. Growth [ 离散化 + dp ]
Problem E. Growth题解: 艰难的补题中...题目中m,x,y都很大,但是n只有1000,所以就将x,y离散化(因为递增可以算是跨越式的);把奖励的x拿出来从小到大排序,得到。把奖励的y拿出来从小到大排序,得到。用表示 a 值到达,b 值达到时接下来每天可以得到的奖励。其中为满足...原创 2018-08-15 11:36:31 · 340 阅读 · 0 评论 -
牛客网暑期ACM多校训练营(第一场)E Removal [计数dp]
E Removal 题目:一个数组序列,有n个数,计算删掉m个数字后不相同的序列的个数;思路:计数dp,总之就是动态规划,我们先算不考虑重复的情况就是状态dp[ i ][ j ]:前 i 个数,删除 j 个的方法数;状态转移方程:dp[ i ][ j ] = dp[ i - 1][ j - 1] + dp[ i - 1 ][ j ];//当前位置数字是否删除!考虑重...原创 2018-07-27 21:19:56 · 363 阅读 · 0 评论 -
Square Country URAL - 1073 [完全背包]
1073. Square CountryTime limit: 1.0 secondMemory limit: 64 MBThere live square people in a square country. Everything in this country is square also. Thus, the Square Parliament has passed a law about...原创 2018-05-14 19:03:37 · 125 阅读 · 0 评论 -
Intervals of Monotonicity URAL - 1346 [递推dp]
1346. Intervals of MonotonicityTime limit: 1.0 secondMemory limit: 64 MBIt’s well known that a domain of any continuous function may be divided into intervals where the function would increase monoton...原创 2018-05-31 14:39:22 · 182 阅读 · 0 评论 -
Lucky Tickets URAL - 1036 [数位dp + java大数]
1036. Lucky TicketsTime limit: 2.0 secondMemory limit: 64 MBYou are given a number 1 ≤ N ≤ 50. Every ticket has its 2N-digit number. We call a ticket lucky, if the sum of its first Ndigits is equal to...原创 2018-05-30 21:14:50 · 237 阅读 · 0 评论 -
Binary Apple Tree URAL - 1018 [简单树形dp]
1018. Binary Apple TreeTime limit: 1.0 secondMemory limit: 64 MBLet's imagine how apple tree looks in binary computer world. You're right, it looks just like a binary tree, i.e. any biparous branch sp...原创 2018-05-30 17:46:32 · 261 阅读 · 0 评论 -
Codeforces 987 C. Three displays [思维 +递推dp]
C. Three displaystime limit per tes :1 secondmemory limit per test :256 megabytesinput :standard inputoutput :standard outputIt is the middle of 2018 and Maria Stepanovna, who lives outside Krasnokame...原创 2018-05-30 09:54:37 · 746 阅读 · 0 评论 -
Doing Homework HDU - 1074 (状压DP)
Doing HomeworkTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 11024 Accepted Submission(s): 5320Problem DescriptionIgnatius has just come bac...原创 2018-05-30 09:43:24 · 225 阅读 · 0 评论 -
L2-008. 最长对称子串
L2-008. 最长对称子串递归超时,改用递推。。。。代码:#include <bits/stdc++.h>#include <algorithm>using namespace std;int const MAX = 505;int const INF = 0x3fffffff;int be[MAX], mi[MAX], len;string s;int d...原创 2018-03-24 13:40:03 · 156 阅读 · 0 评论 -
Brackets Sequence URAL - 1183 [区间dp]
1183. Brackets SequenceTime limit: 1.0 secondMemory limit: 64 MBLet us define a regular brackets sequence in the following way:Empty sequence is a regular sequence.If S is a regular sequence, then (S)...原创 2018-05-24 21:52:57 · 200 阅读 · 0 评论 -
Sense of Beauty URAL - 1501 [ dp + dfs记忆化搜索]
1501. Sense of BeautyTime limit: 0.5 secondMemory limit: 64 MBThe owner of a casino for New Russians has a very refined sense of beauty. For example, after a game there remain two piles with the same ...原创 2018-05-29 19:53:30 · 218 阅读 · 0 评论 -
Threeprime Numbers URAL - 1586 [数位DP]
1586. Threeprime NumbersTime limit: 1.0 secondMemory limit: 64 MBRest at the sea is wonderful! However, programmer Pasha became awfully bored of lying on a beach in Turkey; so bored that he decided to...原创 2018-05-14 21:08:12 · 275 阅读 · 0 评论 -
Staircases URAL - 1017 [递推]
1017. StaircasesTime limit: 1.0 secondMemory limit: 64 MBOne curious child has a set of N little bricks (5 ≤ N ≤ 500). From these bricks he builds different staircases. Staircase consists of steps of ...原创 2018-05-14 20:05:22 · 315 阅读 · 0 评论 -
Super Jumping! Jumping! Jumping! HDU 1087
Super Jumping! Jumping! Jumping!Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 45946 Accepted Submission(s): 21294Problem DescriptionNowaday...原创 2018-04-13 16:01:42 · 115 阅读 · 0 评论 -
Monkey and Banana HDU 1069
Monkey and BananaTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 18081 Accepted Submission(s): 9688Problem DescriptionA group of researchers ...原创 2018-04-13 15:39:00 · 159 阅读 · 0 评论 -
Ignatius and the Princess IV HDU - 1029
Ignatius and the Princess IVTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32767 K (Java/Others)Total Submission(s): 40385 Accepted Submission(s): 17600Problem Description"OK, you ar...原创 2018-04-12 20:28:02 · 152 阅读 · 0 评论 -
ACM最大字段和问题
HDU1003Max Sum题意:给n个数,求最大连续字段的和以及起始位置。状态转移方程:dp[i] = max(dp[i] + s[i], s[i]);理解起来就是以s[i]结尾的最大连续字段上一个状态只有两种:连续的,或者重新开始。代码:#include<bits/stdc++.h>#define ll long longusing namespace std;const i...原创 2018-04-12 19:43:00 · 297 阅读 · 0 评论 -
FATE HDU 2159 DP 完全背包
FATE Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 17275 Accepted Submission(s): 8115 Problem Description最近xhd正在玩一款叫做FATE的游戏,...原创 2018-04-17 21:50:29 · 118 阅读 · 0 评论 -
Bone Collector HDU 2602 DP 01 背包
Bone Collector Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 76372 Accepted Submission(s): 31644 Problem DescriptionMany year...原创 2018-04-17 21:00:29 · 148 阅读 · 0 评论 -
最大报销额 HDU 1864 01背包 DP
最大报销额Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 29829 Accepted Submission(s): 9151Problem Description现有一笔经费可以报销一定额度的发票。允许报销的发票类型包括买图书(A类...原创 2018-04-17 20:48:24 · 164 阅读 · 0 评论