dp~~~~~~~~~~~~~~
martinue
攻城狮
展开
-
leetcode 123
给定一个数组,它的第i个元素是一支给定的股票在第i天的价格。设计一个算法来计算你所能获取的最大利润。你最多可以完成两笔交易。注意:你不能同时参与多笔交易(你必须在再次购买前出售掉之前的股票)。示例1:输入: [3,3,5,0,0,3,1,4]输出: 6解释: 在第 4 天(股票价格 = 0)的时候买入,在第 6 天(股票价格 = 3)的时候卖出,这笔交易所能获...原创 2019-03-28 16:54:20 · 337 阅读 · 0 评论 -
poj2411(状态压缩dp)
Mondriaan's DreamTime Limit: 3000MS Memory Limit: 65536KTotal Submissions: 14198 Accepted: 8191DescriptionSquares and rectangles fascinated the famous Dutch pai原创 2016-03-21 21:56:23 · 563 阅读 · 0 评论 -
hdu4758(ac自动机,状态压缩dp)
Walk Through SquaresTime Limit: 4000/2000 MS (Java/Others) Memory Limit: 65535/65535 K (Java/Others)Total Submission(s): 1136 Accepted Submission(s): 356Problem Description原创 2016-03-17 20:11:48 · 585 阅读 · 0 评论 -
hdu4568(spfa,状态压缩dp)
HunterTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1668 Accepted Submission(s): 501Problem Description One day, a hunter原创 2016-03-16 21:55:05 · 575 阅读 · 0 评论 -
hdu4057(ac自动机,状态压缩dp)
Rescue the RabbitTime Limit: 20000/10000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1790 Accepted Submission(s): 512Problem DescriptionDr. X i原创 2016-03-15 14:42:05 · 1297 阅读 · 0 评论 -
hdu2825(ac自动机,状态压缩dp)
Wireless PasswordTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 5524 Accepted Submission(s): 1741Problem DescriptionLiyuan lives in a old ap...原创 2016-03-16 13:50:48 · 665 阅读 · 2 评论 -
poj1180(斜率优化dp)
Batch SchedulingTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 3693 Accepted: 1708DescriptionThere is a sequence of N jobs to be processed on one mac原创 2016-04-20 21:27:25 · 486 阅读 · 0 评论 -
poj2817(状态压缩dp基础题)
WordStackTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 3435 Accepted: 1254DescriptionAs editor of a small-town newspaper, you know that a substantia原创 2016-05-27 19:47:49 · 783 阅读 · 0 评论 -
NEFU 642 monkey(记忆化搜索)
description Cc is a lovely monkey. It likes to play the game "catching plates". The game is as follows. There are n pegs in a line numbered from 1 to n. Cc stands on the first peg at原创 2015-05-07 00:44:36 · 493 阅读 · 0 评论 -
hdu4109(拓扑排序,dp)
DescriptionAli has taken the Computer Organization and Architecture course this term. He learned that there may be dependence between instructions, like WAR (write after read), WAW, RAW. If the原创 2015-08-18 19:21:53 · 922 阅读 · 0 评论 -
hdu5001(概率dp)
WalkTime Limit: 30000/15000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 957 Accepted Submission(s): 610Special JudgeProblem DescriptionI used t原创 2016-04-14 22:06:56 · 389 阅读 · 0 评论 -
hdu4405(概率dp)
Aeroplane chessTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2958 Accepted Submission(s): 1902Problem DescriptionHzz loves原创 2016-04-15 17:43:57 · 373 阅读 · 0 评论 -
zoj3822(概率dp)
DescriptionEdward is the headmaster of Marjar University. He is enthusiastic about chess and often plays chess with his friends. What's more, he bought a large decorative chessboard with N rows an原创 2016-04-18 19:38:33 · 700 阅读 · 0 评论 -
zoj3329(概率dp)
DescriptionThere is a very simple and interesting one-person game. You have 3 dice, namely Die1, Die2 and Die3. Die1 has K1 faces. Die2 hasK2 faces. Die3 has K3 faces. All the dice are fair dice原创 2016-04-18 21:41:38 · 460 阅读 · 0 评论 -
HDU1058 Humble Numbers
Problem DescriptionA number whose only prime factors are 2,3,5 or 7 is called a humble number. The sequence 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 12, 14, 15, 16, 18, 20, 21, 24, 25, 27, ... shows the fir原创 2015-04-27 23:51:17 · 430 阅读 · 0 评论 -
hdu1428(spfa与记忆化搜索)
漫步校园Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 3508 Accepted Submission(s): 1066Problem DescriptionLL最近沉迷于AC不能自拔,每天寝室、机房原创 2015-08-30 17:43:49 · 397 阅读 · 0 评论 -
nefu1037回文子序列数(区间dp)
description给定字符串,求它的回文子序列个数。回文子序列反转字符顺序后仍然与原序列相同。例如字符串aba中,回文子序列为"a", "a", "aa", "b", "aba",共5个。内容相同位置不同的子序列算不同的子序列。input第一行一个整数T,表示数据组数。之后是T组数据,每组数据为一行字符串。原创 2015-05-04 20:53:35 · 553 阅读 · 0 评论 -
hdu 1203(完全背包)
Problem DescriptionSpeakless很早就想出国,现在他已经考完了所有需要的考试,准备了所有要准备的材料,于是,便需要去申请学校了。要申请国外的任何大学,你都要交纳一定的申请费用,这可是很惊人的。Speakless没有多少钱,总共只攒了n万美元。他将在m个学校中选择若干的(当然要在他的经济承受范围内)。每个学校都有不同的申请费用a(万美元),并且Speakless估计了原创 2015-05-11 23:29:06 · 1625 阅读 · 0 评论 -
poj1185(状态压缩dp)
炮兵阵地Time Limit: 2000MS Memory Limit: 65536KTotal Submissions: 23321 Accepted: 9027Description司令部的将军们打算在N*M的网格地图上部署他们的炮兵部队。一个N*M的地图由N行M列组成,地图的每一格可能是山地(用"H" 表示),也原创 2016-03-24 11:12:51 · 427 阅读 · 0 评论 -
poj3311(状态压缩dp)
Hie with the PieTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 5896 Accepted: 3180DescriptionThe Pizazz Pizzeria prides itself in delivering pizzas t原创 2016-03-24 18:51:00 · 427 阅读 · 0 评论 -
hdu3001(状态压缩dp,三进制!)
TravellingTime Limit: 6000/3000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 5896 Accepted Submission(s): 1908Problem DescriptionAfter coding so原创 2016-03-24 20:25:32 · 914 阅读 · 11 评论 -
leetcode 135
老师想给孩子们分发糖果,有N个孩子站成了一条直线,老师会根据每个孩子的表现,预先给他们评分。你需要按照以下要求,帮助老师给这些孩子分发糖果:每个孩子至少分配到 1 个糖果。 相邻的孩子中,评分高的孩子必须获得更多的糖果。那么这样下来,老师至少需要准备多少颗糖果呢?示例1:输入: [1,0,2]输出: 5解释: 你可以分别给这三个孩子分发 2、1、2 颗糖果。示...原创 2019-03-10 16:27:16 · 334 阅读 · 0 评论 -
leetcode 72
给定两个单词 word1 和 word2,计算出将 word1 转换成 word2 所使用的最少操作数 。你可以对一个单词进行如下三种操作:插入一个字符 删除一个字符 替换一个字符示例 1:输入: word1 = "horse", word2 = "ros"输出: 3解释: horse -> rorse (将 'h' 替换为 'r')rorse -> ros...原创 2019-02-23 20:05:48 · 184 阅读 · 0 评论 -
leetcode 124
给定一个非空二叉树,返回其最大路径和。本题中,路径被定义为一条从树中任意节点出发,达到任意节点的序列。该路径至少包含一个节点,且不一定经过根节点。示例 1:输入: [1,2,3] 1 / \ 2 3输出: 6示例 2:输入: [-10,9,20,null,null,15,7] -10 / \ 9 20 ...原创 2018-09-20 17:29:05 · 365 阅读 · 0 评论 -
hihocoder 1239 Fibonacci(微软2016校园招聘9月在线笔试)
#1239 : Fibonacci时间限制:10000ms单点时限:1000ms内存限制:256MB描述Given a sequence {an}, how many non-empty sub-sequence of it is a prefix of fibonacci sequence.A sub-sequence is a seq原创 2017-02-07 18:52:09 · 452 阅读 · 0 评论 -
最少拦截系统(简单dp)
description某国为了防御敌国的导弹袭击,发展出一种导弹拦截系统.但是这种导弹拦截系统有一个缺陷:虽然它的第一发炮弹能够到达任意的高度,但是以后每一发炮弹都不能超过前一发的高度.某天,雷达捕捉到敌国的导弹来袭.由于该系统还在试用阶段,所以只有一套系统,因此有可能不能拦截所有的导弹.怎么办呢?多搞几套系统呗!你说说倒蛮容易,成本呢?成本是个大问原创 2015-02-11 20:04:14 · 553 阅读 · 0 评论 -
CCF 201403-4 无线网络(spfa+dp)
问题描述 目前在一个很大的平面房间里有 n 个无线路由器,每个无线路由器都固定在某个点上。任何两个无线路由器只要距离不超过 r 就能互相建立网络连接。 除此以外,另有 m 个可以摆放无线路由器的位置。你可以在这些位置中选择至多 k 个增设新的路由器。 你的目标是使得第 1 个路由器和第 2 个路由器之间的网络连接经过尽量少的中转路由器。请问在最优方案下中转路由器的最少个数是多少?原创 2016-12-02 21:05:26 · 508 阅读 · 0 评论 -
PAT 1040 有几个PAT(dp)
1040. 有几个PAT(25)字符串APPAPT中包含了两个单词“PAT”,其中第一个PAT是第2位(P),第4位(A),第6位(T);第二个PAT是第3位(P),第4位(A),第6位(T)。现给定字符串,问一共可以形成多少个PAT?输入格式:输入只有一行,包含一个字符串,长度不超过105,只包含P、A、T三种字母。输出格式:在一行中输出给定字符串中包含多少个PA原创 2016-12-02 15:28:59 · 395 阅读 · 0 评论 -
BNUOJ52325 Increasing or Decreasing(数位dp)
题意:给你一个区间,让你求区间里面数字的每一位数字都不递增或不递减的数的个数,比如1234,55543,432,11,4这些,求这些数的个数。思路:数位dp,用dp[i][j][0or1]表示i位数字以j开头,0表示下降,1表示上升的满足题意的数的个数。用fu[i][j]表示i位以j开头的上升和下降重复的数的个数。要注意处理下降的数的时候得把以0开头的特殊记,否则转移方程写起来会更麻烦= =原创 2016-10-06 14:31:01 · 450 阅读 · 0 评论 -
hdu5791(2016多校第五场,dp,相同子序列的个数)
TwoTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 1500 Accepted Submission(s): 414Problem DescriptionAlice gets two sequences A原创 2016-08-04 11:57:33 · 444 阅读 · 0 评论 -
hdu5900(2016沈阳网络赛1009区间dp)
QSC and MasterTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 0 Accepted Submission(s): 0Problem DescriptionEvery school has so原创 2016-09-18 17:04:54 · 981 阅读 · 0 评论 -
hdu5783(2016多校第五场,dp)
Divide the SequenceTime Limit: 5000/2500 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 2232 Accepted Submission(s): 628Problem DescriptionAlice has a原创 2016-08-06 11:42:25 · 397 阅读 · 0 评论 -
hdu5773(2016多校第四场,最长上升子序列n*logn变形)
The All-purpose ZeroTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 1097 Accepted Submission(s): 271Problem Description?? gets an原创 2016-07-29 10:38:49 · 653 阅读 · 0 评论 -
hdu2476(区间dp)
Problem DescriptionThere are two strings A and B with equal length. Both strings are made up of lower case letters. Now you have a powerful string painter. With the help of the painter, you can ch原创 2015-05-24 17:01:13 · 1379 阅读 · 0 评论 -
poj2955(简单区间dp)
DescriptionWe give the following inductive definition of a “regular brackets” sequence:the empty sequence is a regular brackets sequence,if s is a regular brackets sequence, then (s) and [s] a原创 2016-06-22 18:56:47 · 1018 阅读 · 0 评论 -
hdu5045(状态压缩dp)
ContestTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 1323 Accepted Submission(s): 534Problem DescriptionIn the ACM Internat原创 2016-04-18 15:48:06 · 464 阅读 · 0 评论 -
poj2288(状态压缩dp)
Islands and BridgesTime Limit: 4000MS Memory Limit: 65536KTotal Submissions: 10168 Accepted: 2648DescriptionGiven a map of islands and bridges that connect thes原创 2016-03-27 18:48:59 · 463 阅读 · 0 评论 -
poj3254(状态压缩dp)
Corn FieldsTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 11466 Accepted: 6008DescriptionFarmer John has purchased a lush new rectangular pasture com原创 2016-03-27 11:57:50 · 410 阅读 · 0 评论 -
hdu 4283(区间dp)
Problem Description The TV shows such as You Are the One has been very popular. In order to meet the need of boys who are still single, TJUT hold the show itself. The show is hold in the Small ha原创 2015-05-22 16:51:06 · 691 阅读 · 0 评论 -
hdu2089(数位dp)
Problem Description杭州人称那些傻乎乎粘嗒嗒的人为62(音:laoer)。杭州交通管理局经常会扩充一些的士车牌照,新近出来一个好消息,以后上牌照,不再含有不吉利的数字了,这样一来,就可以消除个别的士司机和乘客的心理障碍,更安全地服务大众。不吉利的数字为所有含有4或62的号码。例如:62315 73418 88914都属于不吉利号码。但是,61152虽然含有原创 2015-05-30 23:55:04 · 388 阅读 · 0 评论