dp
文章平均质量分 73
zoe_ed
这个作者很懒,什么都没留下…
展开
-
UVa 825 - Walking on the Safe Side(简单DP+数据读入)
Square City is a very easy place for people to walk around. The two-way streets run North-South or East-West dividing the city into regular blocks. Most street intersections are safe for pedestrians to原创 2015-11-17 01:37:56 · 448 阅读 · 0 评论 -
LightOJ - 1032 Fast Bit Calculations(数位DP/ 递推)
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 representation which is actually a series of原创 2017-08-21 13:39:52 · 401 阅读 · 0 评论 -
LightOJ 1018 Brush (IV)(状态压缩DP)
Mubashwir returned home from the contest and got angry after seeing his room dusty. Who likes to see a dusty room after a brain storming programming contest? After checking a bit he found an old toothb原创 2017-08-14 13:42:06 · 278 阅读 · 0 评论 -
CQU TaoSama与煎饼 (dp)
题意: 有n个点 每个点有不同的美味度, 现在给你一些道具 可以跳1格2格3格4格 保证所有道具全部用完可以飞到第n个台子 问你能收获的最大美味度分析: 状态定义f[i][j][k][p] 表示+1+2+3+4种道具各用了多少个 那么当前位置pos=i+j*2+k*3+p*4+1;注意是从第一个点出发 然后就可以开始转移 转移就考虑这个点可以从哪些点跳过来emmmm没什么好说的#in原创 2017-06-03 22:17:11 · 286 阅读 · 0 评论 -
HackerRank - lucky-numbers(数位DP)
A number is called lucky if the sum of its digits, as well as the sum of the squares of its digits is a prime number. How many numbers between A and B(both inclusive) are lucky?Lucky numbers are not to原创 2017-05-06 16:09:14 · 482 阅读 · 0 评论 -
POJ 2229 Sumsets(dp 递推)
Farmer John commanded his cows to search for different sets of numbers that sum to a given number. The cows use only numbers that are an integer power of 2. Here are the possible sets of numbers that s原创 2016-08-02 20:32:54 · 319 阅读 · 0 评论 -
lightOJ Discovering Gold(期望DP入门)
期望DP理解:http://kicd.blog.163.com/blog/static/126961911200910168335852/kuangbin期望DP练习题: http://www.cnblogs.com/kuangbin/archive/2012/10/02/2710606.htmlDescription You are in a cave, a long cave! The ca原创 2016-08-04 13:31:22 · 404 阅读 · 0 评论 -
CQU 雷神之路(DP+矩阵加速)
Time Limit: 10000 MSMemory Limit: 32768 K雷神之路描述zzblack成功通关SAO,现在,等待他的将是雷神之路。雷神之路 是在x轴上的一条路。雷神在路的尽头放了无尽的宝藏。一开始, zzblack在初始点0,每次能走一步,两步或者三步,路的尽头的点 坐标为n。雷神为了增大游戏的难度,在路上放置了m个地雷(不能 踩上去),每个地雷的坐标为,然而,原创 2016-05-26 15:32:10 · 538 阅读 · 0 评论 -
HDU 钱币兑换问题(完全背包?)
Time Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64u SubmitStatus Description 在一个国家仅有1分,2分,3分硬币,将钱N兑换成硬币有很多种兑法。请你编程序计算出共有多少种兑法。Input 每行只有一个正整数N,N小于32768。Output 对应每个输入,输出兑换方原创 2015-12-07 22:09:24 · 511 阅读 · 0 评论 -
CodeForces 599D Spongebob and Squares(DP+math)
Spongebob and Squares Time Limit:2000MS Memory Limit:262144KB 64bit IO Format:%I64d & %I64u SubmitStatusPracticeCodeForces 599D Description Spongebob is already tired trying to reason his w原创 2016-01-23 11:51:11 · 560 阅读 · 0 评论 -
CodeForces 431C K-Tree
Description Quite recently a creative student Lesha had a lecture on trees. After the lecture Lesha was inspired and came up with the tree of his own which he called a k-tree.A k-tree is an infinite r原创 2016-01-21 21:08:39 · 438 阅读 · 0 评论 -
HDU3496 Watch The Movie(二维费用背包)
Watch The Movie Time Limit:1000MS Memory Limit:65535KB 64bit IO Format:%I64d & %I64u SubmitStatus Description New semester is coming, and DuoDuo has to go to school tomorrow. She decides to原创 2015-12-03 17:14:10 · 398 阅读 · 0 评论 -
HDU15年新生赛 1005 ACM组队安排(DP+组合公式)
Problem Description ACM亚洲区比赛结束,意味着开始备战明年的浙江省大学生程序设计竞赛了! 杭州电子科技大学ACM集训队也准备开始组队。 教练想把所有的n个队员组成若干支队伍,原则是每支队伍至少一人,最多三人。 现在问题来了:如果已知集训队队员的数量n,请你帮教练计算出所有可能的组队方案有多少种。特别说明: 队伍没有编号,即如果有A,B,C三人,{A原创 2015-11-29 22:55:08 · 786 阅读 · 1 评论 -
UVA10081 Tight Words(dp)
Given is an alphabet {0,1,…,k}, 0 ≤ k ≤ 9. We say that a word of length n over this alphabet is tight if any two neighbour digits in the word do not differ by more than 1. Input Input is a sequence o原创 2015-10-31 20:32:55 · 489 阅读 · 0 评论 -
UVa 10617 Again Palindrome(回文 区间dp)
A palindorme is a sequence of one or more characters that reads the same from the left as it does from the right. For example, Z, TOT and MADAM are palindromes, but ADAM is not. Given a sequence S of原创 2015-10-29 14:53:56 · 427 阅读 · 0 评论 -
UVA1025 A Spy in the Metro(dp)
Secret agent Maria was sent to Algorithms City to carry out an especially dangerous mission. After several thrilling events we find her in the first station of Algorithms City Metro, examining the time原创 2015-10-26 21:32:22 · 502 阅读 · 0 评论 -
LightOJ - 1021 Painful Bases(状压DP)
As you know that sometimes base conversion is a painful task. But still there are interesting facts in bases.For convenience let’s assume that we are dealing with the bases from 2 to 16. The valid symb原创 2017-08-14 16:04:14 · 288 阅读 · 0 评论