DP
文章平均质量分 72
Byte__
ACM成长中。
展开
-
数的划分 搜索 ,DP
1006: 数的划分Time Limit: 1 Sec Memory Limit: 128 MB 64bit IO Format: %lldSubmitted: 44 Accepted: 22[Submit][Status][Web Board]Description 将整数n分成k份,且每份不能为空,任意两份不能相同(不考虑顺序)。 例如:n=7,k原创 2017-04-06 15:45:17 · 672 阅读 · 0 评论 -
hdu 3336 Count the string KMP+DP
Count the stringTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 6375 Accepted Submission(s): 2947Problem DescriptionIt is wel原创 2015-08-13 10:09:33 · 838 阅读 · 0 评论 -
hdu 3738 The Sweat Shop 单调栈加贪心思想
The Sweat ShopTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 90 Accepted Submission(s): 28Problem DescriptionMany people spe原创 2015-08-25 09:50:18 · 890 阅读 · 0 评论 -
ZOJ 3450 Doraemon's Railgun
Doraemon's RailgunTime Limit: 2 Seconds Memory Limit: 65536 KBDoraemon's city is being attacked again. This time Doraemon has built a powerful railgun in the city. So he will use it t原创 2015-07-29 20:12:06 · 554 阅读 · 0 评论 -
ZOJ 3690 Choosing number
Choosing numberTime Limit: 2 Seconds Memory Limit: 65536 KBThere are n people standing in a row. And There are m numbers, 1.2...m. Every one should choose a number. But if two persons s原创 2015-07-08 09:34:51 · 667 阅读 · 0 评论 -
ZOJ 3431 Escape!
Escape!Time Limit: 2 Seconds Memory Limit: 65536 KBThe usual stuff, after you beat the boss at the topmost floor of his castle, the evil boss triggers the auto destruct function of his ca转载 2015-07-27 13:57:22 · 493 阅读 · 0 评论 -
ZOJ 1039 Number Game 记忆化搜索+二进制状态压缩
Number GameTime Limit: 10 Seconds Memory Limit: 32768 KBBackgroundChristiane and Matthias are playing a new game, the Number Game. The rules of the Number Game are:Christian and原创 2015-07-10 10:51:17 · 949 阅读 · 0 评论 -
ZOJ 3747 Attack on Titans
Attack on TitansTime Limit: 2 Seconds Memory Limit: 65536 KBOver centuries ago, mankind faced a new enemy, the Titans. The difference of power between mankind and their newfound enemy w原创 2015-07-08 22:36:40 · 1988 阅读 · 0 评论 -
XTU 1206 Dormitory's Elevator
Dormitory's ElevatorAccepted : 52 Submit : 332Time Limit : 1000 MS Memory Limit : 65536 KBProblem DescriptionThe new dormitory has N(1≤N≤100000) floors an原创 2015-05-23 16:25:51 · 793 阅读 · 0 评论 -
ZOJ 3822 Domination 概率DP求期望
DominationTime Limit: 8 Seconds Memory Limit: 131072 KB Special JudgeEdward is the headmaster of Marjar University. He is enthusiastic about chess and often plays chess with hi原创 2015-04-09 09:40:35 · 796 阅读 · 0 评论 -
hdu 2639 Bone Collector II
Bone Collector IITime Limit: 5000/2000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2759 Accepted Submission(s): 1428Problem DescriptionThe title of原创 2015-04-06 16:30:36 · 501 阅读 · 0 评论 -
hdu 1059 Dividing 多重背包,二进制优化
DividingTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 18995 Accepted Submission(s): 5305Problem DescriptionMarsha and Bill own原创 2015-03-28 19:32:33 · 514 阅读 · 0 评论 -
ZOJ 3434 Hiiragi's Sticks
Hiiragi's SticksTime Limit: 3 Seconds Memory Limit: 65536 KBHiiragi likes collecting sticks. It is said that she has collected m short sticks. One day, she was very excited that she fou原创 2015-07-24 09:57:53 · 904 阅读 · 0 评论 -
HDU 3920 Clear All of Them I 状压DP
Clear All of Them ITime Limit: 2000/1000 MS (Java/Others) Memory Limit: 122768/62768 K (Java/Others)Total Submission(s): 1681 Accepted Submission(s): 544Problem DescriptionAcmers原创 2015-08-18 20:59:25 · 847 阅读 · 0 评论 -
UVALive6952 Cent Savings DP
Sample Input5 113 21 55 60 425 21 1 1 1 1Sample Output1900题意:一个人买了N件物品,最多可以分d次付款,付款遵循四舍五入原则,即如果14块,那么只用付10元,如果15块,那么要付20元。问怎么分配付款能让付的钱总数最小。思路:一种DP隔板的方式。#include #include #i原创 2015-11-05 10:39:36 · 678 阅读 · 0 评论 -
方格取数 多线程动态规划
1005: 方格取数Time Limit: 1 Sec Memory Limit: 128 MB 64bit IO Format: %lldSubmitted: 31 Accepted: 12[Submit][Status][Web Board]Description 设有N*N的方格图(N 某人从图的左上角的A 点(1,1)出发,可以向下行走,也可以原创 2017-04-07 16:15:25 · 835 阅读 · 0 评论 -
金明的预算方案 01背包变形
1010: 金明的预算方案Time Limit: 1 Sec Memory Limit: 128 MB 64bit IO Format: %lldSubmitted: 67 Accepted: 16[Submit][Status][Web Board]Description金明今天很开心,家里购置的新房就要领钥匙了,新房里有一间金明自己专用的很宽敞的房间。原创 2017-04-07 16:08:20 · 513 阅读 · 0 评论 -
结点选择 搜索,dp思想
1003: 结点选择Time Limit: 1 Sec Memory Limit: 128 MB 64bit IO Format: %lldSubmitted: 25 Accepted: 8[Submit][Status][Web Board]Description有一棵 n 个节点的树,树上每个节点都有一个正整数权值。如果一个点被选择了,那么在树上和它相原创 2017-04-07 11:15:17 · 401 阅读 · 0 评论 -
HDU 1074 Doing Homework(状压DP)
Doing HomeworkTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 8320 Accepted Submission(s): 3842Problem DescriptionIgnatius ha原创 2016-11-03 11:36:37 · 327 阅读 · 0 评论 -
UVA 437 The Tower of Babylon
题意:给n种立体块,每种有无限个,上面的块长宽必须小于下面的块,问最多可以搭建多高思路:输入的时候小小处理下,把每个块各条边当高的情况存入结构体中,按升序排序,然后dp,比较求出最大值。。看好多代码都说什么最长上升子序列,感觉没有用到额,LIS的标记数组是用来存储相应长度的最小值的,没看出来哪里用上了额。。。数据范围小,直接就是dp了=。=#include #include #原创 2014-08-20 21:23:09 · 846 阅读 · 0 评论 -
HDU3779Railroad DP 记忆化搜索
RailroadTime Limit: 4000/2000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 938 Accepted Submission(s): 386Problem DescriptionA train yard is a c原创 2016-05-26 16:46:14 · 492 阅读 · 0 评论 -
HDU 5653 Bomber Man wants to bomb an Array.(DP问题)
Bomber Man wants to bomb an Array.Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 556 Accepted Submission(s): 190Problem Descript原创 2016-05-11 23:06:34 · 562 阅读 · 0 评论 -
ZOJ1986 Bridging Signals onlogn复杂度求LIS
Bridging SignalsTime Limit: 2 Seconds Memory Limit: 65536 KB'Oh no, they've done it again', cries the chief designer at the Waferland chip factory. Once more the routing designers have原创 2016-03-19 16:25:28 · 581 阅读 · 0 评论 -
URAL1017Staircases DP
E - StaircasesTime Limit:1000MS Memory Limit:65536KB 64bit IO Format:%I64d & %I64uSubmit Status Practice URAL 1017DescriptionOne curious child has a set of N little bri原创 2016-03-16 22:11:39 · 618 阅读 · 0 评论 -
HDU4405 Aeroplane chess
Aeroplane chessTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2780 Accepted Submission(s): 1779Problem DescriptionHzz loves原创 2015-12-26 17:40:01 · 464 阅读 · 0 评论 -
HDU4472 Count DP
CountTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2148 Accepted Submission(s): 1421Problem DescriptionProf. Tigris is the原创 2015-11-02 22:39:58 · 150 阅读 · 0 评论 -
hdu 1171 Big Event in HDU
Big Event in HDUTime Limit: 10000/5000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 26285 Accepted Submission(s): 9244Problem DescriptionNowadays, w原创 2015-03-28 20:27:25 · 475 阅读 · 0 评论 -
hdu 1203
I NEED A OFFER!Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 18210 Accepted Submission(s): 7291Problem DescriptionSpeakless很早就想原创 2015-03-28 19:58:45 · 543 阅读 · 0 评论 -
HDU 1025 Constructing Roads In JGShining's Kingdom
Constructing Roads In JGShining's KingdomTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 16283 Accepted Submission(s): 4638Proble原创 2014-10-24 21:29:43 · 675 阅读 · 0 评论 -
HDu 5074 Hatsune Miku
Hatsune MikuTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 262144/262144 K (Java/Others)Total Submission(s): 186 Accepted Submission(s): 142Problem DescriptionHatsune Miku原创 2014-10-23 19:30:55 · 704 阅读 · 0 评论 -
UVA 1025 A Spy in the Metro
小白紫书上动态规划专题的原题,shu原创 2014-08-27 10:57:45 · 720 阅读 · 0 评论 -
POJ 2738 Two Ends 记忆化搜索
记忆化搜索,有不明白的一个小地方,求指教。。。原创 2014-08-13 14:32:13 · 912 阅读 · 0 评论 -
POJ1609 Tiling Up Blocks
无情的一题!!!读了半小时题,才把题目看懂,发现是LIS后写了二分的那种方法,node[i]向ans[i]赋值的时候len++了两次,样例跑不出来,从机房走出去看见一只小猫,回来就发现了bug=。=结果一提交,RE,检查发现n最大10000我开的22222,没开小,百度里面看到有人也用这个方法提交后也是RE。。。自己出了几组数据后发现貌似不能用二分写呢(至少我还没想到该怎么改,看到后知原创 2014-08-11 15:05:29 · 860 阅读 · 0 评论 -
POJ 1631 Bridging signals
LIS两种经典实现方法原创 2014-08-11 08:49:02 · 896 阅读 · 0 评论 -
HDU1506 Largest Rectangle in a Histogram
题意:计算连续的块的最大面积原创 2014-07-30 19:38:19 · 662 阅读 · 0 评论 -
POJ1276 cash machine
#include #include#include#include#include#include#define N 520009using namespace std;int vol[N];int val[N];int cash;int dp[N];void zeroonebag(int c,int w){ for(int i=cas原创 2014-07-28 10:42:19 · 779 阅读 · 0 评论 -
POJ 1837 Balance
题意:有一个天平,有C个go原创 2014-07-28 09:51:01 · 721 阅读 · 0 评论 -
POJ 3211Washing Clothes
只能说,无情的一题。。。原创 2014-08-01 09:20:23 · 1036 阅读 · 1 评论 -
HDU 2844 coins
做的第一个多重背包,看了原创 2014-07-24 08:59:15 · 614 阅读 · 0 评论 -
CF#271 (Div. 2) D Flowers.(dp)
D. Flowerstime limit per test1.5 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputWe saw the little game Marmot made for Mole's原创 2014-10-07 17:39:11 · 840 阅读 · 0 评论