dp
文章平均质量分 68
动态规划之dp
楚江枫
不忘初心,方得始终
展开
-
【Codeforces 283 C. Coin Troubles】+ 拓扑序 + 完全背包
C. Coin Troubles time limit per test2 seconds memory limit per test256 megabytes inputstandard input outputstandard output In the Isle of Guernsey there are n different types of coins. For each i原创 2017-05-01 21:53:57 · 462 阅读 · 0 评论 -
【Light oj 1140 - How Many Zeroes?】 + 数位 dp
1140 - How Many Zeroes? PDF (English) Statistics Forum Time Limit: 2 second(s) Memory Limit: 32 MB Jimmy writes down the decimal representations of all natural numbers between and includi原创 2017-04-08 18:15:25 · 505 阅读 · 0 评论 -
【玲珑 OJ 1067 Digital Count】+ 数位 dp
1067 - Digital Count Time Limit:1s Memory Limit:1024MByteSubmissions:507Solved:111DESCRIPTION Given three integers a, b, P, count the total number of digit P appearing in all integers from a to b.INP原创 2017-04-08 19:07:28 · 375 阅读 · 0 评论 -
【CSU 1175: A Tour Around Hangzhou】+ 状压dp + dijkstra
1175: A Tour Around Hangzhou Submit Page Summary Time Limit: 2 Sec Memory Limit: 128 Mb Submitted: 111 Solved: 30 Description swimming来到杭州旅行,杭州是个美丽的城市,有很多美丽的景点.但让他头痛的是这些景原创 2017-04-13 15:02:39 · 678 阅读 · 0 评论 -
【HPU 1267 Cafeteria】+ 01dp
1267: Cafeteria [DP] 时间限制: 1 Sec 内存限制: 128 MB提交: 55 解决: 24 状态 题目描述Nanae把饥肠辘辘的josnch带去一家自助餐厅,面对面前眼花缭乱的美味josnch呆住了。 假设有N种食物,每种食物只有一样,而且每种食物有对应的体积Wi (1 <= Wi <= 400),食用每一种食物都能增加对应的愉悦值Di(1 <= Di <= 100).原创 2017-02-27 17:37:28 · 540 阅读 · 0 评论 -
【HDU 杭电 1260 Tickets】
TicketsProblem Description Jesus, what a great movie! Thousands of people are rushing to the cinema. However, this is really a tuff time for Joe who sells the film tickets. He is wandering when could原创 2016-08-08 19:21:13 · 437 阅读 · 0 评论 -
【HDU 杭电 1003 Max Sum】
Max SumProblem Description Given a sequence a[1],a[2],a[3]……a[n], your job is to calculate the max sum of a sub-sequence. For example, given (6,-1,5,4,-7), the max sum in this sequence is 6 + (-1) + 5原创 2016-08-08 19:32:24 · 403 阅读 · 0 评论 -
【HDU 杭电 1231 最大连续子序列】
最大连续子序列Problem Description 给定K个整数的序列{ N1, N2, …, NK },其任意连续子序列可表示为{ Ni, Ni+1, …, Nj },其中 1 <= i <= j <= K。最大连续子序列是所有连续子序列中元素和最大的一个, 例如给定序列{ -2, 11, -4, 13, -5, -2 },其最大连续子序列为{ 11, -4, 13 },最大和 为原创 2016-08-08 19:36:02 · 329 阅读 · 0 评论 -
【HDU 杭电 1176 免费馅饼】
免费馅饼Problem Description 都说天上不会掉馅饼,但有一天gameboy正走在回家的小径上,忽然天上掉下大把大把的馅饼。说来gameboy的人品实在是太好了,这馅饼别处都不掉,就掉落在他身旁的10米范围内。馅饼如果掉在了地上当然就不能吃了,所以gameboy马上卸下身上的背包去接。但由于小径两侧都不能站人,所以他只能在小径上接。由于gameboy平时老呆在房间里玩游戏,虽然在游戏原创 2016-08-08 20:40:59 · 440 阅读 · 0 评论 -
【POJ 1745 Divisibility】
DivisibilityDescriptionConsider an arbitrary sequence of integers. One can place + or - operators between integers in the sequence, thus deriving different arithmetical expressions that evaluate to dif原创 2016-08-08 21:54:08 · 418 阅读 · 0 评论 -
【HDU 杭电 2059 龟兔赛跑】
龟兔赛跑Problem Description 据说在很久很久以前,可怜的兔子经历了人生中最大的打击——赛跑输给乌龟后,心中郁闷,发誓要报仇雪恨,于是躲进了杭州下沙某农业园卧薪尝胆潜心修炼,终于练成了绝技,能够毫不休息得以恒定的速度(VR m/s)一直跑。兔子一直想找机会好好得教训一下乌龟,以雪前耻。 最近正值HDU举办50周年校庆,社会各大名流齐聚下沙,兔子也趁此机会向乌龟发起挑战。虽然乌龟深原创 2016-08-08 23:21:42 · 509 阅读 · 0 评论 -
【zzulioj 1904: 小火山的股票交易】
1904: 小火山的股票交易Description“股市有风险,入市需谨慎”,小火山经历了之前买卖一次或者两次的股票♂交易,对于股票买卖已经很有经验了, 现在的他最多可以进行K次买卖,身为一个聪明的acmer,已经准确的知道了某只股票在未来N天的价格,每一次买入必须 卖出后才能进行下次买卖。现在,小火山想知道他最多可以获得多少利润? Input输入第一行是一个整数T(T <= 50), 表示原创 2016-09-08 22:57:02 · 639 阅读 · 0 评论 -
【zzulioj 1837 LT说我不服 + dp】
Description对于上一道题目LT不服,表示那么简单的题目不屑于去做,所以我们决定加大一下题目的难度,下面是我们LT出的题目: 假如给你一个由n个数组成的序列A1, A2, A3, A4 …… An。你可以选择任意一个大小的区间,将其中的每一个数x变成(x*1888+101)%14507。 求这n个数的最大和可能是多少。 Input输入有多组数据 每组数据第一行输入一个整数n为序列元素原创 2016-09-12 09:07:41 · 404 阅读 · 0 评论 -
【SDUT [2146]最小子序列和】
最小子序列和 Time Limit: 1000MS Memory Limit: 65536KB Problem Description给你一个长为n(10Input有多组(小于11组)测试数据,每组第一行输入n和k(用空格隔开),第二行输入n个数(数之间用空格隔开)。 Output请输出最小的和。 Example Input15 5 5 4 3 2 1 1 2 3 4原创 2016-09-12 10:28:26 · 553 阅读 · 0 评论 -
【HDU 2571 命运 +dp】
命运 Problem Description 穿过幽谷意味着离大魔王lemon已经无限接近了! 可谁能想到,yifenfei在斩杀了一些虾兵蟹将后,却再次面临命运大迷宫的考验,这是魔王lemon设下的又一个机关。要知道,不论何人,若在迷宫中被困1小时以上,则必死无疑! 可怜的yifenfei为了去救MM,义无返顾地跳进了迷宫。让我们一起帮帮执着的他吧! 命运大迷宫可以看成是一个两维的方格阵原创 2016-09-22 08:12:10 · 387 阅读 · 0 评论 -
【Lightoj 1032 Fast Bit Calculations 】
Fast Bit CalculationsDescription A bit is a binary digit, taking a logical value of either 1 or 0 (also referred to as “true” or “false” respectively). And every decimal number has a binary representa原创 2016-09-23 09:54:07 · 497 阅读 · 0 评论 -
【HDU 5904 LCIS + dp】
LCIS Problem Description Alex has two sequences a1,a2,…,an and b1,b2,…,bm. He wants find a longest common subsequence that consists of consecutive values in increasing order.Input There are multiple原创 2016-09-24 22:49:07 · 661 阅读 · 0 评论 -
【 lightoj 1047 - Neighbor House + dp】
Description The people of Mohammadpur have decided to paint each of their houses red, green, or blue. They’ve also decided that no two neighboring houses will be painted the same color. The neighbors原创 2016-10-01 14:43:33 · 639 阅读 · 0 评论 -
【LightOJ 1122 + dp】
Description Given a set of digits S, and an integer n, you have to find how many n-digit integers are there, which contain digits that belong to S and the difference between any two adjacent digits is原创 2016-10-01 18:59:15 · 1215 阅读 · 0 评论 -
【OpenJ_Bailian 4120】 + dp
硬币 Time Limit: 1000MS Memory Limit: 262144KB 64bit IO Format: %I64d & %I64u SubmitStatusDescription 宇航员Bob有一天来到火星上,他有收集硬币的习惯。于是他将火星上所有面值的硬币都收集起来了,一共有n种,每种只有一个:面值分别为a1,a2… an。 Bob在机场看到了一个特别原创 2016-10-02 16:53:34 · 601 阅读 · 3 评论 -
【Codeforces 629 C Famil Door and Brackets 】+ dp
C. Famil Door and Brackets time limit per test 2 seconds memory limit per test 256 megabytes input standard input output standard outputAs Famil Door’s birthday is coming, some of his friends (原创 2016-12-23 00:00:39 · 650 阅读 · 0 评论 -
【Codefroces 490 C Hacking Cypher】+ dp
C. Tennis Championship time limit per test 2 seconds memory limit per test 256 megabytes input standard input output standard outputFamous Brazil city Rio de Janeiro holds a tennis tournament a原创 2017-02-05 20:56:11 · 398 阅读 · 0 评论 -
【Codeforces 766 C Mahmoud and a Message】 + dp
C. Mahmoud and a Message time limit per test 2 seconds memory limit per test 256 megabytes input standard input output standard outputMahmoud wrote a message s of length n. He wants to send it原创 2017-02-08 16:54:59 · 532 阅读 · 0 评论 -
【HPU 1235 入学考试 】+ 01dp
1235: 入学考试 [DP] 时间限制: 1 Sec 内存限制: 128 MB提交: 18 解决: 8 题目描述辰辰是个天资聪颖的孩子,他的梦想是成为世界上最伟大的医师。为此,他想拜附近最有威望的医师为师。医师为了判断他的资质,给他出了一个难题。医师把他带到一个到处都是草药的山洞里对他说:“孩子,这个山洞里有一些不同的草药,采每一株都需要一些时间,每一株也有它自身的价值。我会给你一段时间,在原创 2017-02-12 14:27:41 · 475 阅读 · 0 评论 -
【Codeforces 711 C】+ dp
C. Coloring Trees time limit per test2 seconds memory limit per test256 megabytes inputstandard input outputstandard output ZS the Coder and Chris the Baboon has arrived at Udayland! They walked i原创 2017-02-18 15:07:13 · 460 阅读 · 0 评论 -
【HDU 1466 计算直线的交点数】+ dp
计算直线的交点数Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 9762 Accepted Submission(s): 4449Problem Description 平面上有n条直线,且无三线共点,问这些直线能有多少种不同交点原创 2017-03-11 11:00:10 · 395 阅读 · 0 评论 -
【HDU 1398 Square Coins】+ 母函数
Square CoinsTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 11874 Accepted Submission(s): 8142Problem Description People in Silverland use原创 2017-03-16 21:36:05 · 602 阅读 · 0 评论 -
【HDU 1059 Dividing 多重背包 】
DividingProblem Description Marsha and Bill own a collection of marbles. They want to split the collection among themselves so that both receive an equal share of the marbles. This would be easy if al原创 2016-08-22 21:49:26 · 347 阅读 · 0 评论 -
【HDU 杭电OJ 1257 最少拦截系统】
最少拦截系统Problem Description 某国为了防御敌国的导弹袭击,发展出一种导弹拦截系统.但是这种导弹拦截系统有一个缺陷:虽然它的第一发炮弹能够到达任意的高度,但是以后每一发炮弹都不能超过前一发的高度.某天,雷达捕捉到敌国的导弹来袭.由于该系统还在试用阶段,所以只有一套系统,因此有可能不能拦截所有的导弹. 怎么办呢?多搞几套系统呗!你说说倒蛮容易,成本呢?成本是个大问题啊.所以俺就原创 2016-08-11 17:07:38 · 793 阅读 · 0 评论 -
【HDU 杭电OJ 1025 Constructing Roads In JGShining's Kingdom】
Constructing Roads In JGShining’s KingdomDescription JGShining’s kingdom consists of 2n(n is no more than 500,000) small cities which are located in two parallel lines. Half of these cities are rich i原创 2016-08-11 17:58:28 · 406 阅读 · 0 评论 -
【HDU 杭电 1051 Wooden Sticks 】
Wooden SticksProblem Description There is a pile of n wooden sticks. The length and weight of each stick are known in advance. The sticks are to be processed by a woodworking machine in one by one fas原创 2016-08-11 21:22:26 · 439 阅读 · 0 评论 -
【 HDU 杭电 1950 Bridging signals】
Bridging signals Problem Description ‘Oh no, they’ve done it again’, cries the chief designer at the Waferland chip factory. Once more the routing designers have screwed up completely, making the sig原创 2016-08-12 08:46:30 · 333 阅读 · 0 评论 -
【HDU 杭电 1087 Super Jumping! Jumping! Jumping!】
Super Jumping! Jumping! Jumping!Problem Description Nowadays, a kind of chess game called “Super Jumping! Jumping! Jumping!” is very popular in HDU. Maybe you are a good boy, and know little about thi原创 2016-08-12 09:21:20 · 406 阅读 · 0 评论 -
【HDU 杭电 5256 序列变换】
Problem Description 我们有一个数列A1,A2…An,你现在要求修改数量最少的元素,使得这个数列严格递增。其中无论是修改前还是修改后,每个元素都必须是整数。 请输出最少需要修改多少个元素。Input 第一行输入一个T(1≤T≤10),表示有多少组数据每一组数据:第一行输入一个N(1≤N≤105),表示数列的长度第二行输入N个数A1,A2,…,An。每一个数列中的元素都是正整数原创 2016-08-12 12:19:13 · 513 阅读 · 0 评论 -
【HDU 杭电 4521 小明系列问题——小明序列】
小明系列问题——小明序列Problem Description 大家都知道小明最喜欢研究跟序列有关的问题了,可是也就因为这样,小明几乎已经玩遍各种序列问题了。可怜的小明苦苦地在各大网站上寻找着新的序列问题,可是找来找去都是自己早已研究过的序列。小明想既然找不到,那就自己来发明一个新的序列问题吧!小明想啊想,终于想出了一个新的序列问题,他欣喜若狂,因为是自己想出来的,于是将其新序列问题命名为“小原创 2016-08-12 16:29:52 · 368 阅读 · 0 评论 -
【POJ 2686 Traveling by Stagecoach】+ 状压dp
Traveling by Stagecoach Time Limit: 2000MS Memory Limit: 65536K Total Submissions: 3102 Accepted: 1162 Special JudgeDescription Once upon a time, there was a traveler.He plans to trave原创 2016-12-06 22:05:26 · 406 阅读 · 0 评论 -
【HDU 2602 Bone Collector】
Bone CollectorProblem Description 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原创 2016-08-15 10:47:21 · 285 阅读 · 0 评论 -
【Codeforces 741 B. Arpa's weak amphitheater and Mehrdad's 】+ 并查集 + 01背包
B. Arpa’s weak amphitheater and Mehrdad’s valuable Hoses time limit per test 1 second memory limit per test 256 megabytes input standard input output standard outputJust to remind, girls in Arp原创 2016-12-10 20:14:28 · 803 阅读 · 0 评论 -
【LightOJ 1068 】+ dp
An integer is divisible by 3 if the sum of its digits is also divisible by 3. For example, 3702 is divisible by 3 and 12 (3+7+0+2) is also divisible by 3. This property also holds for the integer 9.In原创 2016-10-02 11:07:19 · 484 阅读 · 0 评论 -
【LightOJ 1064 】Throwing Dice + dp
Throwing Dice n common cubic dice are thrown. What is the probability that the sum of all thrown dice is at least x?Input Input starts with an integer T (≤ 200), denoting the number of test cases.Eac原创 2016-10-02 09:30:42 · 618 阅读 · 0 评论