动态规划
这条街上最靓的妞儿
这个作者很懒,什么都没留下…
展开
-
1730数字三角形问题(三角形内路径最大)
数字三角形问题Time Limit: 1000MS Memory Limit: 65536KB Submit Statistic Discuss Problem Description给定一个由n行数字组成的数字三角形如下图所示。试设计一个算法,计算出从三角形的顶至底的一条路径,使该路径经过的数字总和最大。对于给定的由n行数字组成的数字三角形,计算从三角形的顶至底的路径经过的数字和的最大值。 Inp原创 2017-08-29 18:49:49 · 585 阅读 · 0 评论 -
CodeForces Fippling Coins(动态规划)
题意:给出n没硬币,最初硬币都是正面朝下,现在让你对这组硬币做k次操作,可以将一枚硬币翻为正面朝上或反面朝上,问你做完这k次操作,硬币所有策略和结果的组合中(combinations of strategies and results,组合,即所有的硬币不做区分)正面朝上的概率的期望值。思路:动态规划。设dp[i][j]表示第i次操作j面硬币朝上的概率。dp[0][0]=1;这个初始化好理解,最初...原创 2018-05-03 20:39:56 · 233 阅读 · 0 评论 -
51 nod 1118 机器人走方格 (动态规划)
1118 机器人走方格 基准时间限制:1 秒 空间限制:131072 KB 分值: 0 难度:基础题 收藏 关注M * N的方格,一个机器人从左上走到右下,只能向右或向下走。有多少种不同的走法?由于方法数量可能很大,只需要输出Mod 10^9 + 7的结果。Input第1行,2个数M,N,中间用空格隔开。(2 <= m,n <= 1000)Output输出走法的数量。Input示例2 ...原创 2018-04-16 19:37:10 · 391 阅读 · 0 评论 -
Cheapest Palindrome
Keeping track of all the cows can be a tricky task so Farmer John has installed a system to automate it. He has installed on each cow an electronic ID tag that the system will read as the cows pass原创 2017-12-07 21:30:03 · 265 阅读 · 0 评论 -
Coins
People in Silverland use coins.They have coins of value A1,A2,A3...An Silverland dollar.One day Tony opened his money-box and found there were some coins.He decided to buy a very nice watch in a nearb原创 2017-12-06 21:30:42 · 396 阅读 · 0 评论 -
Dollar Dayz
Farmer John 想知道,在一家商品价格为1至K (1 InputN 、 K. OutputFJ花钱的方法数 Sample Input5 3Sample Output5Hint1*3+1*2 1*3+2*1 1*2+3*1 2*2+1*1 5*1这道题要注意对大数的处理!!k=1原创 2017-12-05 19:13:12 · 339 阅读 · 0 评论 -
Wooden Sticks
题目连接:https://cn.vjudge.net/contest/202335#problem/IThere 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 machi原创 2017-12-04 19:23:13 · 398 阅读 · 0 评论 -
Apple Catching
It is a little known fact that cows love apples. Farmer John has two apple trees (which are conveniently numbered 1 and 2) in his field, each full of apples. Bessie cannot reach the apples when they原创 2017-12-03 14:37:41 · 283 阅读 · 0 评论 -
Milking Time
题目连接:https://cn.vjudge.net/contest/202335#problem/DBessie is such a hard-working cow. In fact, she is so focused on maximizing her productivity that she decides to schedule her next N (1 ≤ N ≤ 1,000原创 2017-12-02 21:16:15 · 362 阅读 · 0 评论 -
Sumsets
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 tha原创 2017-12-02 20:08:30 · 298 阅读 · 0 评论 -
Space Elevator
The cows are going to space! They plan to achieve orbit by building a sort of space elevator: a giant tower of blocks. They have K (1 <= K <= 400) different types of blocks with which to build the tow转载 2017-12-02 16:13:41 · 681 阅读 · 0 评论 -
Bridging signals
Bridging signalsTime Limit: 1000MSMemory Limit: 10000KTotal Submissions: 10926Accepted: 5982Description'Oh no, they've done it again', cries the chief designer at the Waferland chip fa原创 2017-12-08 18:11:47 · 209 阅读 · 0 评论 -
2852小鑫爬山(三角形内路径最小)
小鑫去爬山 Time Limit: 1000MS Memory Limit: 65536KB Submit Statistic Discuss Problem Description 马上就要放假了,小鑫打算去爬山。 小鑫要去爬的这座山有n个海拔区间。为了清楚描述我们可以从上到下标号1到n。 第i个区间有i个落脚点,每一个落脚点都有一个危险值。 小鑫需要在第n个海拔区间挑选一个点向原创 2017-08-29 21:33:32 · 265 阅读 · 0 评论 -
51 nod 1085 背包问题 (01背包问题)
1085 背包问题 基准时间限制:1 秒 空间限制:131072 KB 分值: 0 难度:基础题 收藏 关注在N件物品取出若干件放在容量为W的背包里,每件物品的体积为W1,W2……Wn(Wi为整数),与之相对应的价值为P1,P2……Pn(Pi为整数)。求背包能够容纳的最大价值。Input第1行,2个整数,N和W中间用空格隔开。N为物品的数量,W为背包的容量。(1 <= N <= 100...原创 2018-04-26 20:05:34 · 116 阅读 · 0 评论