![](https://img-blog.csdnimg.cn/20201014180756780.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
dp
文章平均质量分 73
AnICoo1
这个作者很懒,什么都没留下…
展开
-
Codeforces Round #367 (Div. 2) C. Hard problem (DP)
C. Hard problemtime limit per test 1 second memory limit per test 256 megabytes input standard input output standard outputVasiliy is fond of solving different tasks. Today he found one he wasn’原创 2016-08-21 14:44:03 · 319 阅读 · 0 评论 -
HDOJ 5569 matrix (DP)
matrixTime Limit: 6000/3000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 340 Accepted Submission(s): 208Problem DescriptionGiven a matrix with n r原创 2015-11-23 20:57:05 · 380 阅读 · 0 评论 -
HDOJ 5532 Almost Sorted Array (正反LIS判断顺序)
Almost Sorted ArrayTime Limit: 4000/2000 MS (Java/Others) Memory Limit: 262144/262144 K (Java/Others)Total Submission(s): 235 Accepted Submission(s): 113Problem DescriptionWe are all原创 2015-11-02 13:30:40 · 612 阅读 · 0 评论 -
ZZULIOJ 1788 小金刚的宝藏 (01背包)
1788: 小金刚的宝藏Time Limit: 1 Sec Memory Limit: 128 MBSubmit: 73 Solved: 21SubmitStatusWeb BoardDescription拿到小金刚的宝藏是每个探险者的梦想。终于有两个寻宝者找到了小金刚的宝藏。里面包含着n个物品,每个物品的价值为w[i],他们决定将财宝平均分。suma代表寻原创 2015-11-22 16:02:33 · 513 阅读 · 0 评论 -
HDOJ 2151 Worm (DP)
WormTime Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3408 Accepted Submission(s): 2195Problem Description自从见识了平安夜苹果的涨价后,Lele就在他家门口原创 2015-11-14 21:39:19 · 357 阅读 · 0 评论 -
POJ 1276 Cash Machine (多重背包转01背包优化)
Cash MachineTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 30096 Accepted: 10848DescriptionA Bank plans to install a machine for cash withdrawal. The mac原创 2015-09-23 22:45:55 · 452 阅读 · 0 评论 -
HDOJ 2157 How many ways?? (DP)
How many ways??Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2163 Accepted Submission(s): 804Problem Description春天到了, HDU校园里开满了原创 2015-11-11 22:22:27 · 342 阅读 · 0 评论 -
HDOJ 1881 毕业bg (01背包)
毕业bgTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 5287 Accepted Submission(s): 1963Problem Description每年毕业的季节都会有大量毕业生发起狂欢,好朋友们相原创 2015-10-23 21:31:55 · 412 阅读 · 0 评论 -
HDOJ 1950 Bridging signals(LIS nlogn)
Bridging signalsTime Limit: 5000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 1224 Accepted Submission(s): 804Problem Description'Oh no, they'v原创 2015-10-22 21:24:26 · 307 阅读 · 0 评论 -
HDOJ 5366 The mook jong(规律)
The mook jongTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 686 Accepted Submission(s): 475Problem Description![](../../data/ima原创 2015-10-06 00:07:41 · 408 阅读 · 0 评论 -
NYOJ 625 笨蛋的难题(二)(DP)
笨蛋的难题(二)时间限制:1000 ms | 内存限制:65535 KB难度:2描述 笨蛋就业了,并且是在上千应聘中脱颖而出的,和他一起脱颖而出的还有傻子。公司的老板对二人视为珍宝,为了激励他们的工作热情,给他们一小时发一次工资(很高兴吧)。但每次只发给一个人,并且每次发的工资可能不同(老板很厉害吧)。傻子和笨蛋为了证明自己比对方智商高,他们事先知道每次发的工资的多少。他们原创 2015-10-01 18:07:11 · 470 阅读 · 0 评论 -
HDOJ 2059 龟兔赛跑 (DP)
龟兔赛跑Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 14311 Accepted Submission(s): 5309Problem Description据说在很久很久以前,可怜的兔子经历了人生中最大的原创 2015-11-25 20:54:39 · 366 阅读 · 0 评论 -
UESTC 1271 Search gold (DP)
题目链接:http://acm.uestc.edu.cn/#/problem/show/1271题意:给你一个地图,起点在(1,1),求能得到的珠宝最多是多少思路:因为只能朝着那几个方向走,所以说就是简单的DP问题了,刚做的时候没看这道题,也没做,唉= =ac代码:#include#include#include#include#include#inclu原创 2016-01-17 22:52:32 · 579 阅读 · 0 评论 -
HDOJ 5586 Sum (最大连续子串和)
SumTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 489 Accepted Submission(s): 275Problem DescriptionThere is a number sequence原创 2015-11-30 20:29:45 · 399 阅读 · 0 评论 -
Codeforces Round #363 (Div. 2) C. Vacations (DP)
C. Vacations time limit per test1 second memory limit per test256 megabytes inputstandard input outputstandard output Vasya has n days of vacations! So he decided to improve his IT skills and do s原创 2016-07-28 10:13:48 · 329 阅读 · 0 评论 -
Codeforces Round #260 (Div. 2) C. Boredom(DP)
C. Boredomtime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputAlex doesn't like boredom. That's why whenever he gets bore原创 2016-03-08 16:56:44 · 355 阅读 · 0 评论 -
HDOJ 1059 Dividing (多重背包二进制优化转01背包)
DividingTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 21606 Accepted Submission(s): 6094Problem DescriptionMarsha and Bill own原创 2016-01-27 17:24:02 · 390 阅读 · 0 评论 -
HDOJ 1025 Constructing Roads In JGShining's Kingdom (LIS nlogn)
Constructing Roads In JGShining's KingdomTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 20601 Accepted Submission(s): 5814Problem原创 2016-01-26 20:07:46 · 678 阅读 · 0 评论 -
HDOJ 1176 免费馅饼 (DP)
免费馅饼Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 35480 Accepted Submission(s): 12095Problem Description都说天上不会掉馅饼,但有一天gameboy正走原创 2016-01-07 22:26:59 · 288 阅读 · 0 评论 -
HDOJ 2571 命运 (DP)
命运Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 13875 Accepted Submission(s): 4898Problem Description穿过幽谷意味着离大魔王lemon已经无限接近了!原创 2016-01-03 22:19:12 · 388 阅读 · 0 评论 -
HDOJ 1069 Monkey and Banana (结构体LIS)
Monkey and BananaTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 10492 Accepted Submission(s): 5446Problem DescriptionA group of原创 2016-01-03 21:16:58 · 340 阅读 · 0 评论 -
HDOJ 2391 Filthy Rich (简单DP)
Filthy RichTime Limit: 10000/5000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2512 Accepted Submission(s): 1118Problem DescriptionThey say that in原创 2016-01-03 16:50:07 · 283 阅读 · 0 评论 -
HDOJ 1466 计算直线的交点数 (DP)
计算直线的交点数Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 9173 Accepted Submission(s): 4141Problem Description平面上有n条直线,且无三线共点,问这些直线原创 2016-01-03 16:08:08 · 387 阅读 · 0 评论 -
Codeforces Good Bye 2015 C. New Year and Domino (预处理)
C. New Year and Dominotime limit per test3 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputThey say "years are like dominoes, tumbling on原创 2015-12-31 23:48:13 · 788 阅读 · 0 评论 -
HDOJ 1503 Advanced Fruits(LCS+记录路径)
Advanced FruitsTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 2136 Accepted Submission(s): 1089Special JudgeProblem DescriptionT原创 2015-10-02 00:40:49 · 477 阅读 · 0 评论 -
NYOJ 18 The Triangle(简单dp)
The Triangle时间限制:1000 ms | 内存限制:65535 KB难度:4描述 73 88 1 02 7 4 44 5 2 6 5(Figure 1)Figure 1 shows a number triangle. Write a program that calculates the highest sum of numbers p原创 2015-09-04 23:34:40 · 513 阅读 · 0 评论 -
汉诺塔(三)
描述 在印度,有这么一个古老的传说:在世界中心贝拿勒斯(在印度北部)的圣庙里,一块黄铜板上插着三根宝石针。印度教的主神梵天在创造世界的时候,在其中一根针上从下到上地穿好了由大到小的64片金片,这就是所谓的汉诺塔。不论白天黑夜,总有一个僧侣在按照下面的法则移动这些金片:一次只移动一片,不管在哪根针上,小片必须在大片上面。僧侣们预言,当所有的金片都从梵天穿好的那根针上移到另外一根针上时,世界就将在原创 2015-08-05 15:26:04 · 411 阅读 · 0 评论 -
NYOJ 814 又见拦截导弹
又见拦截导弹时间限制:3000 ms | 内存限制:65535 KB难度:3描述 大家对拦截导弹那个题目应该比较熟悉了,我再叙述一下题意:某国为了防御敌国的导弹袭击,新研制出来一种导弹拦截系统。但是这种导弹拦截系统有一个缺陷:它的第一发炮弹能够到达任意的高度,但是以后每一发炮弹都不能超过前一发的高度。突然有一天,雷达捕捉到敌国的导弹来袭。由于该系统存在缺陷,所以如果想把所有原创 2015-08-28 09:50:29 · 336 阅读 · 0 评论 -
HDU 1003 Max Sum(最长连续子串和)
Max SumTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 175786 Accepted Submission(s): 40946Problem DescriptionGiven a sequence a[原创 2015-07-21 10:02:20 · 442 阅读 · 0 评论 -
HDOJ 3466 Proud Merchants(01背包)
Proud MerchantsTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 131072/65536 K (Java/Others)Total Submission(s): 3588 Accepted Submission(s): 1497Problem DescriptionRecently,原创 2015-08-26 18:11:33 · 468 阅读 · 0 评论 -
HDOJ 1203 I NEED A OFFER!(01背包)
I NEED A OFFER!Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 20459 Accepted Submission(s): 8167Problem DescriptionSpeakless很早就想原创 2015-08-26 16:41:11 · 355 阅读 · 0 评论 -
HDOJ 1114 Piggy-Bank(完全背包)
Piggy-BankTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 16338 Accepted Submission(s): 8237Problem DescriptionBefore ACM can do原创 2015-08-26 20:09:04 · 354 阅读 · 0 评论 -
NYOJ 860 又见01背包
又见01背包时间限制:1000 ms | 内存限制:65535 KB难度:3描述 有n个重量和价值分别为wi 和 vi 的 物品,从这些物品中选择总重量不超过 W 的物品,求所有挑选方案中物品价值总和的最大值。 1 1 1 1 输入多组测试数据。每组测试数据第一行输入,n 和 W ,接下来有n行,每行输入两个数,代表第i个物原创 2015-08-10 20:39:46 · 283 阅读 · 0 评论 -
NYOJ 311 完全背包
完全背包时间限制:3000 ms | 内存限制:65535 KB难度:4描述 直接说题意,完全背包定义有N种物品和一个容量为V的背包,每种物品都有无限件可用。第i种物品的体积是c,价值是w。求解将哪些物品装入背包可使这些物品的体积总和不超过背包容量,且价值总和最大。本题要求是背包恰好装满背包时,求出最大价值总和是多少。如果不能恰好装满背包,输出NO输入第一行: N 表示原创 2015-08-10 19:07:34 · 267 阅读 · 0 评论 -
HDOJ 1513 Palindrome(LCS)
PalindromeTime Limit: 4000/2000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 3883 Accepted Submission(s): 1332Problem DescriptionA palindrome is a s原创 2015-08-10 15:26:32 · 421 阅读 · 1 评论 -
NYOJ 36 最长公共子序列(基础LCS)
最长公共子序列时间限制:3000 ms | 内存限制:65535 KB难度:3描述 咱们就不拐弯抹角了,如题,需要你做的就是写一个程序,得出最长公共子序列。tip:最长公共子序列也称作最长公共子串(不要求连续),英文缩写为LCS(Longest Common Subsequence)。其定义是,一个序列 S ,如果分别是两个或多个已知序列的子序列,且是所有符合此条件序列中最原创 2015-08-06 20:55:19 · 311 阅读 · 0 评论 -
NYOJ 036 最长公共子序列(dp )
描述 咱们就不拐弯抹角了,如题,需要你做的就是写一个程序,得出最长公共子序列。tip:最长公共子序列也称作最长公共子串(不要求连续),英文缩写为LCS(Longest Common Subsequence)。其定义是,一个序列 S ,如果分别是两个或多个已知序列的子序列,且是所有符合此条件序列中最长的,则 S 称为已知序列的最长公共子序列。输入第一行给出一个整数N(0接下来每组数据两行原创 2015-06-19 12:03:41 · 392 阅读 · 0 评论 -
HDOJ 1087 Super Jumping! Jumping! Jumping!(LIS变形)
Super Jumping! Jumping! Jumping!Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 27514 Accepted Submission(s): 12216Problem Descript原创 2015-08-03 21:07:51 · 223 阅读 · 0 评论 -
HDOJ 1677 Nested Dolls(贪心+LIS)
Nested DollsTime Limit: 3000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3019 Accepted Submission(s): 898Problem DescriptionDilworth is the wo原创 2015-08-03 20:55:43 · 288 阅读 · 0 评论 -
HDOJ 1800 Flying to the Mars(LIS)
Flying to the MarsTime Limit: 5000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 13889 Accepted Submission(s): 4432Problem DescriptionIn t原创 2015-08-04 10:44:27 · 237 阅读 · 0 评论