DP - 随笔分类(第2页) - ERKE

Racing Car Computer dp

摘要：Racing Car ComputerInput:Standard InputOutput:Standard OutputThe racing cars of today are equipped with so many sophisticated equipment. Introduction of a new visual transducer which is interfaced with the on-board computer can tell you on the fly how many cars are ahead of you while how many are tr 阅读全文

posted @ 2014-04-05 09:57 ERKE 阅读(259) 评论(0) 推荐(0)

Race to 1 概率dp

摘要：Race to 1Time Limit:10000MSMemory Limit:Unknown64bit IO Format:%lld & %llu[Submit] [Go Back] [Status]DescriptionBRace to 1Input:Standard InputOutput:Standard OutputDilu have learned a new thing about integers, which is - any positive integer greater than 1 can be divided by at least one prime nu 阅读全文

posted @ 2014-04-05 00:26 ERKE 阅读(178) 评论(0) 推荐(0)

不要62 hdu2089

摘要：不要62Time Limit: 1000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 16975Accepted Submission(s): 5566Problem Description杭州人称那些傻乎乎粘嗒嗒的人为62（音：laoer）。杭州交通管理局经常会扩充一些的士车牌照，新近出来一个好消息，以后上牌照，不再含有不吉利的数字了，这样一来，就可以消除个别的士司机和乘客的心理障碍，更安全地服务大众。不吉利的数字为所有含有4或62的号码。例如：62315 73418 8 阅读全文

posted @ 2014-04-02 13:04 ERKE 阅读(260) 评论(0) 推荐(0)

Dice (II) （DP）唉，当时没做出来

摘要：Dice (II)Time Limit:3000MSMemory Limit:32768KB64bit IO Format:%lld & %llu[Submit] [Go Back] [Status]DescriptionYou haveNdices; each of them hasKfaces numbered from1toK. Now you can arrange theNdices in a line. If the summation of the top faces of the dices isS, you calculate the score as the mul 阅读全文

posted @ 2014-03-08 21:05 ERKE 阅读(310) 评论(0) 推荐(0)

D. Mysterious Present (看到的一个神奇的DP，也可以说是dfs）

摘要：D. Mysterious Presenttime limit per test2 secondsmemory limit per test64 megabytesinputstandard inputoutputstandard outputPeter decided to wish happy birthday to his friend from Australia and send him a card. To make his present more mysterious, he decided to make achain. Chain here is such a sequen 阅读全文

posted @ 2014-03-07 20:52 ERKE 阅读(308) 评论(0) 推荐(0)

E. Fish （概率DP）

摘要：E. Fishtime limit per test3 secondsmemory limit per test128 megabytesinputstandard inputoutputstandard outputnfish, numbered from1ton, live in a lake. Every day right one pair of fish meet, and the probability of each other pair meeting is the same. If two fish with indexes i and j meet, the first w 阅读全文

posted @ 2014-03-07 13:11 ERKE 阅读(251) 评论(0) 推荐(0)

郑厂长系列故事——排兵布阵 hdu4539（状态压缩DP）

摘要：郑厂长系列故事——排兵布阵Time Limit: 10000/5000 MS (Java/Others)Memory Limit: 65535/32768 K (Java/Others)Total Submission(s): 1509Accepted Submission(s): 554Problem Description 郑厂长不是正厂长也不是副厂长他根本就不是厂长事实上他是带兵打仗的团长一天，郑厂长带着他的军队来到了一个n*m的平原准备布阵。根据以往的战斗经验，每个士兵可以攻击到并且只能攻击到与之曼哈顿距离为2的位置以及士兵本身所在的位置。当然，一个士兵不能站... 阅读全文

posted @ 2014-03-06 22:20 ERKE 阅读(288) 评论(0) 推荐(0)

Corn Fields poj3254(状态压缩DP）

摘要：Corn FieldsTime Limit:2000MSMemory Limit:65536KTotal Submissions:6081Accepted:3226DescriptionFarmer John has purchased a lush new rectangular pasture composed ofMbyN(1 ≤M≤ 12; 1 ≤N≤ 12) square parcels. He wants to grow some yummy corn for the cows on a number of squares. Regrettably, some of the squ 阅读全文

posted @ 2014-03-06 19:28 ERKE 阅读(222) 评论(0) 推荐(0)

C - Coin Change (III)（多重背包二进制优化）

摘要：C -Coin Change (III)Time Limit:2000MSMemory Limit:32768KB64bit IO Format:%lld & %lluSubmitStatusPracticeLightOJ 1233DescriptionIn a strange shop there arentypes of coins of valueA1, A2... An.C1, C2, ... Cndenote the number of coins of valueA1, A2... Anrespectively. You have to find the number of 阅读全文

posted @ 2014-03-05 13:16 ERKE 阅读(205) 评论(0) 推荐(0)

Coin Change (II)(完全背包)

摘要：Coin Change (II)Time Limit:1000MSMemory Limit:32768KB64bit IO Format:%lld & %llu[Submit] [Go Back] [Status]DescriptionIn a strange shop there arentypes of coins of valueA1, A2... An. You have to find the number of ways you can makeKusing the coins. You can use any coin a... 阅读全文

posted @ 2014-03-05 13:12 ERKE 阅读(297) 评论(0) 推荐(0)

The Twin Towers zoj2059 DP

摘要：The Twin TowersTime Limit:2 Seconds Memory Limit:65536 KBTwin towers we see you standing tall, though a building's lost our faith will never fall.Twin towers the world hears your call, though you're gone it only strengthens our resolve.We couldn't make it through this without you Lord, t 阅读全文

posted @ 2014-03-03 19:01 ERKE 阅读(304) 评论(0) 推荐(0)

1523. K-inversions URAL 求k逆序对，，，，DP加树状数组

摘要：1523. K-inversionsTime limit: 1.0 secondMemory limit: 64 MBConsider a permutationa1,a2, …,an(allaiare different integers in range from 1 ton). Let us callk-inversiona sequence of numbersi1,i2, …,iksuch that 1≤i1ai2>…>aik. Your task is to evaluate the number of differentk-inversions in a given 阅读全文

posted @ 2014-03-03 13:20 ERKE 阅读(343) 评论(0) 推荐(0)

Football 概率DP poj3071

摘要：FootballTime Limit:1000MSMemory Limit:65536KTotal Submissions:2590Accepted:1315DescriptionConsider a single-elimination football tournament involving 2nteams, denoted 1, 2, …, 2n. In each round of the tournament, all teams still in the tournament are pla... 阅读全文

posted @ 2014-03-02 10:17 ERKE 阅读(187) 评论(0) 推荐(0)

Collecting Bugs poj2096 概率DP

摘要：Collecting BugsTime Limit:10000MSMemory Limit:64000KTotal Submissions:1899Accepted:901Case Time Limit:2000MSSpecial JudgeDescriptionIvan is fond of collecting. Unlike other people who collect post stamps, coins or other material stuff, he collects software bugs. When Iv... 阅读全文

posted @ 2014-03-02 00:25 ERKE 阅读(172) 评论(0) 推荐(0)

D. How many trees? DP

摘要：D. How many trees?time limit per test1 secondmemory limit per test64 megabytesinputstandard inputoutputstandard outputIn one very old text file there was written Great Wisdom. This Wisdom was so Great that nobody could decipher it, even Phong — the oldest among the inhabitants of... 阅读全文

posted @ 2014-02-28 08:57 ERKE 阅读(448) 评论(0) 推荐(0)

hdu4632

摘要：Palindrome subsequenceTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 131072/65535 K (Java/Others) Total Submission(s): 1538Accepted Submission(s): 635 Problem DescriptionIn mathematics, a subsequence is a sequence that can be derived from another sequence by deleting some elements without chang 阅读全文

posted @ 2013-08-14 12:49 ERKE 阅读(205) 评论(0) 推荐(0)

随笔分类 - DP