记忆化dp
tomjobs
别慌,慌也没用
展开
-
Round F 2020 - Kick Start 2020 Yeetzhee(期望,记忆化搜索)
ProblemPommel is very bored at home so she has invented a new game involving N dice. Each die has the numbers from 1 to M written on it. Whenever she throws a die, it has an equal probability of landing on each of the M possible values.Pommel places all原创 2020-09-27 17:21:32 · 518 阅读 · 0 评论 -
Leetcode周赛200 5478. 最大得分(DP)
思路:果然是想复杂了,其实双指针就OK了,因为决策是单调且互补影响的,你把两个序列相同数字合并起来,那么每次取合并区间内大的一个就好了。我是记忆化搜索写的(很丑),要是想到双指针的方法估计就能进前50了吧,思维不太行啊class Solution {public: typedef long long ll; int n1,n2; ll f[100005][2]; map<ll,int>mp1,mp2; ll mod = 1e9 + 7; .原创 2020-08-02 13:12:11 · 284 阅读 · 0 评论 -
Ralph and Mushrooms CodeForces - 894E(tarjan缩点+dp)
Ralph is going to collect mushrooms in the Mushroom Forest.There are m directed paths connecting n trees in the Mushroom Forest. On each path grow some mushrooms. When Ralph passes a path, he collects all the mushrooms on the path. The Mushroom Forest has原创 2020-05-14 15:10:19 · 349 阅读 · 0 评论 -
P1434 [SHOI2002]滑雪(记忆化搜索)
展开题目描述Michael喜欢滑雪。这并不奇怪,因为滑雪的确很刺激。可是为了获得速度,滑的区域必须向下倾斜,而且当你滑到坡底,你不得不再次走上坡或者等待升降机来载你。Michael想知道在一个区域中最长的滑坡。区域由一个二维数组给出。数组的每个数字代表点的高度。下面是一个例子:1 2 3 4 516 17 18 19 615 24 25 20 714...原创 2019-09-06 23:48:59 · 272 阅读 · 0 评论