![](https://img-blog.csdnimg.cn/20201014180756925.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
ACM_DP
文章平均质量分 82
雨狮子
这个作者很懒,什么都没留下…
展开
-
poj 1050 To the Max
To the MaxTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 41890 Accepted: 22255DescriptionGiven a two-dimensional array of positive and negative integ原创 2015-02-18 02:19:38 · 399 阅读 · 0 评论 -
noj 1860 保研(01背包 概率dp)
C. 保研时间限制(普通/Java) : 1000 MS/ 3000 MS 运行内存限制 : 65536 KByte总提交 : 171 测试通过 : 40 题目描述 对于一些名校而言,保研不仅可以由学校推免,也可以由学生自己向希望保研的学校提出申请,这个过程有点类似于外国学生向学校提交简历等待Offer的过程。但是,投递原创 2015-04-15 19:21:36 · 728 阅读 · 0 评论 -
poj 1088 滑雪(线性DP)
滑雪Time Limit: 1000MS Memory Limit: 65536KTotal Submissions: 81553 Accepted: 30437DescriptionMichael喜欢滑雪百这并不奇怪, 因为滑雪的确很刺激。可是为了获得速度,滑的区域必须向下倾斜,而且当你滑到坡底,你不得不再次走上坡或者等待升原创 2015-05-18 10:57:00 · 649 阅读 · 0 评论 -
Codeforces Round #338 (Div. 2) B. Longtail Hedgehog
B. Longtail Hedgehog time limit per test3 seconds memory limit per test256 megabytes inputstandard input outputstandard output This Christmas Santa gave Masha a magic picture and a pencil. The pic原创 2016-02-13 15:26:08 · 519 阅读 · 0 评论 -
文章标题
历届试题 买不到的数目 时间限制:1.0s 内存限制:256.0MB问题描述小明开了一家糖果店。他别出心裁:把水果糖包成4颗一包和7颗一包的两种。糖果不能拆包卖。小朋友来买糖的时候,他就用这两种包装来组合。当然有些糖果数目是无法组合出来的,比如要买 10 颗糖。你可以用计算机测试一下,在这种包装情况下,最大不能买到的数量是17。大于17的任何数字都可以用4和7组合出来。本题的要求就是在已知两个原创 2016-02-02 22:25:47 · 334 阅读 · 0 评论 -
P1990 覆盖墙壁
你有一个长为N宽为2的墙壁,给你两种砖头:一个长2宽1,另一个是L型覆盖3个单元的砖头。如下图:0 00 00砖头可以旋转,两种砖头可以无限制提供。你的任务是计算用这两种来覆盖N*2的墙壁的覆盖方法。例如一个2*3的墙可以有5种覆盖方法,如下:012 002 011 001 011012 112 022 011 001注意可以使用两种砖头混合起来覆盖,如2*4的墙可以这原创 2016-03-13 09:29:45 · 1319 阅读 · 0 评论 -
P1616 疯狂的采药
题目描述 DescriptionLiYuxiang是个天资聪颖的孩子,他的梦想是成为世界上最伟大的医师。为此,他想拜附近最有威望的医师为师。医师为了判断他的资质,给他出了一个难题。医师把他带到一个到处都是草药的山洞里对他说:“孩子,这个山洞里有一些不同种类的草药,采每一种都需要一些时间,每一种也有它自身的价值。我会给你一段时间,在这段时间里,你可以采到一些草药。如果你是一个聪明的孩原创 2016-03-13 12:10:56 · 584 阅读 · 0 评论 -
POJ 2342 Anniversary party (树形dp)
Anniversary partyTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 5874 Accepted: 3378DescriptionThere is going to be a party to celebrate the 80-th Ann原创 2016-03-14 21:06:09 · 447 阅读 · 0 评论 -
hdu 1864 最大报销额 (01背包)
最大报销额Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 26372 Accepted Submission(s): 8119Problem Description现有一笔经费可以报销一定额度的发票。允原创 2017-08-11 22:56:52 · 346 阅读 · 0 评论 -
hdu 2546 饭卡 (01背包)
饭卡Time Limit: 5000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 33150 Accepted Submission(s): 11461Problem Description电子科大本部食堂的饭卡有一种很诡异的设计,原创 2017-09-10 15:46:33 · 319 阅读 · 0 评论 -
LightOJ 1047 Neighbor House (DP 数字三角形变形)
1047 - Neighbor HousePDF (English)StatisticsForumTime Limit: 0.5 second(s)Memory Limit: 32 MBThe people of Mohammadpur have decided to paint each ofth原创 2015-04-07 08:06:15 · 740 阅读 · 0 评论 -
LightOJ 1004 Monkey Banana Problem (DP 数字三角形)
1004 - Monkey Banana ProblemPDF (English)StatisticsForumTime Limit: 2 second(s)Memory Limit: 32 MBYou are in the world of mathematics to solve the gre原创 2015-04-07 07:49:19 · 813 阅读 · 0 评论 -
poj 3624 Charm Bracelet
Charm BraceletTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 25370 Accepted: 11418DescriptionBessie has gone to the mall's jewelry store and spies a原创 2015-03-09 20:31:07 · 565 阅读 · 0 评论 -
Codeforces 518D Ilya and Escalator
D. Ilya and Escalatortime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputIlya got tired of sports programming,原创 2015-03-08 13:08:53 · 903 阅读 · 0 评论 -
hdu 1506 Largest Rectangle in a Histogram (DP)
Largest Rectangle in a HistogramTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 12947 Accepted Submission(s): 3653Problem Des原创 2015-04-03 12:28:49 · 478 阅读 · 0 评论 -
hdu 1231 最大连续子序列(DP)
最大连续子序列Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 21166 Accepted Submission(s): 9387Problem Description给定K个整数的序列{ N1, N2原创 2015-04-03 09:52:03 · 643 阅读 · 0 评论 -
hdu 1087 Super Jumping! Jumping! Jumping!(DP)
Super Jumping! Jumping! Jumping!Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 25057 Accepted Submission(s): 11073Problem De原创 2015-04-03 09:30:06 · 507 阅读 · 0 评论 -
poj 2250 Compromise(裸LCS DP)
CompromiseTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 6766 Accepted: 3023 Special JudgeDescriptionIn a few months the European Currency Union原创 2015-04-05 17:04:43 · 591 阅读 · 0 评论 -
LightOJ 1231 Coin Change (I) (背包计数模板题)
1231 - Coin Change (I)PDF (English)StatisticsForumTime Limit: 1 second(s)Memory Limit: 32 MBIn a strange shop there are n types of coins of valueA1, A原创 2015-04-06 08:15:19 · 942 阅读 · 0 评论 -
hdu 3127 WHUgirls(完全背包)
WHUgirlsTime Limit: 3000/2000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 2251 Accepted Submission(s): 852Problem DescriptionThere are many原创 2015-04-06 20:22:08 · 464 阅读 · 0 评论 -
poj 1836 Alignment (DP LIS)
AlignmentTime Limit: 1000MS Memory Limit: 30000KTotal Submissions: 13839 Accepted: 4478DescriptionIn the army, a platoon is composed by n soldiers. During the m原创 2015-04-06 23:24:54 · 501 阅读 · 0 评论 -
hdu 3466 Proud Merchants (01背包 + 结构体的sort排序)
Proud MerchantsTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 131072/65536 K (Java/Others)Total Submission(s): 7069 Accepted Submission(s): 2944Problem DescriptionRecently,原创 2017-09-12 10:41:34 · 420 阅读 · 0 评论