动态规划
文章平均质量分 87
红鲤鱼遇绿鲤鱼
只要思想不滑坡,办法总比困难多~
展开
-
cf Codeforces Round 888 E. Nastya and Potions
有n种药,每种药有可能使用其它几种已有的药进行合成且不会自己合成自己。给你c1到cn标识每种药的购买加个,其中有k种药p1到pk表示这k个药已经有了,而且无限供应。接下是n行,每行表示合成第i种药需要的其它药的下标。很简单很基础的记忆化搜索,每种药要么使用其它药合成,要么直接购买即可。最后输出n个整数,输出每种药获得的最少花销。原创 2023-08-25 00:35:26 · 270 阅读 · 0 评论 -
cf Educational Codeforces Round 141 D. Different Arrays
cf 141 d different arrays原创 2023-03-16 22:15:42 · 549 阅读 · 0 评论 -
cf Educational Codeforces Round 133 E. Swap and Maximum Block
cf 133 e原创 2022-09-17 11:11:35 · 247 阅读 · 0 评论 -
cf Educational Codeforces Round 133 D. Chip Move
cf 133 d dp原创 2022-09-13 17:37:04 · 197 阅读 · 0 评论 -
cf Educational Codeforces Round 133 C. Robot in a Hallway
cf 133 c dp原创 2022-09-13 16:51:19 · 257 阅读 · 0 评论 -
cf Educational Codeforces Round 127 E. Preorder
原题:E. Preordertime limit per test2 secondsmemory limit per test512 megabytesinputstandard inputoutputstandard outputYou are given a rooted tree of 2n−12^n−12n−1 vertices. Every vertex of this tree has either 0 children, or 2 children. All leaves原创 2022-05-29 14:49:44 · 179 阅读 · 0 评论 -
洛谷 P4516 潜入行动
原题:外星人又双叒叕要攻打地球了,外星母舰已经向地球航行!这一次,JYY 已经联系好了黄金舰队,打算联合所有 JSOIer 抵御外星人的进攻。在黄金舰队就位之前,JYY 打算事先了解外星人的进攻计划。现在,携带了监听设备的特工已经秘密潜入了外星人的母舰,准备对外星人的通信实施监听。外星人的母舰可以看成是一棵 n 个节点、 n−1 条边的无向树,树上的节点用 1,2,⋯ ,n 编号。JYY 的特工已经装备了隐形模块,可以在外星人母舰中不受限制地活动,可以神不知鬼不觉地在节点上安装监听设备。如果在节点原创 2021-08-07 00:28:14 · 150 阅读 · 0 评论 -
洛谷 P2014 选课
原题:题目描述在大学里每个学生,为了达到一定的学分,必须从很多课程里选择一些课程来学习,在课程里有些课程必须在某些课程之前学习,如高等数学总是在其它课程之前学习。现在有 N 门功课,每门课有个学分,每门课有一门或没有直接先修课(若课程 a 是课程 b 的先修课即只有学完了课程 a,才能学习课程 b)。一个学生要从这些课程里选择 M 门课程学习,问他能获得的最大学分是多少?输入格式第一行有两个整数 N , M 用空格隔开。( 1≤N≤300 , 1≤M≤300 )接下来的 N 行,第 I+1 行包含原创 2021-07-30 21:22:07 · 205 阅读 · 0 评论 -
洛谷 P3574 FAR-FarmCraft
原题:在一个叫做比特村的小村庄中,有n−1条路连接着这个村庄中的全部n个房子。每两个房子之间都有一条唯一的通路。这些房子的编号为1至nnn。1号房子属于村庄的管理员比特安萨尔。为了提升村庄的科技使用水平,n台电脑被快递到了比特安萨尔的房子。每个房子都应该有一台电脑,且分发电脑的任务就落在了比特安萨尔的肩上。比特村的居民一致同意去玩农场物语这个游戏的最新快照版,而且好消息是他们很快就要得到他们最新的高配置电脑了。比特安萨尔将所有电脑都装在了他的卡车上,而且他准备好完成这个艰巨的任务了。他的汽油恰原创 2021-06-26 16:13:17 · 173 阅读 · 0 评论 -
poj 1463 Strategic game
原题:Strategic gameTime Limit: 2000MS Memory Limit: 10000KTotal Submissions: 13192 Accepted: 5971DescriptionBob enjoys playing computer games, especially strategic games, but sometimes he cannot find the solution fast enough and then he is very sad. N原创 2021-06-13 09:59:04 · 147 阅读 · 0 评论 -
hdoj 2196 Computer
原题:A school bought the first computer some time ago(so this computer’s id is 1). During the recent years the school bought N-1 new computers. Each new computer was connected to one of settled earlier. Managers of school are anxious about slow functioning原创 2021-06-13 09:42:29 · 157 阅读 · 0 评论 -
洛谷 1352 没有上司的舞会
** 原题:**题目描述某大学有 nnn 个职员,编号为 1…n1\ldots n1…n。他们之间有从属关系,也就是说他们的关系就像一棵以校长为根的树,父结点就是子结点的直接上司。现在有个周年庆宴会,宴会每邀请来一个职员都会增加一定的快乐指数 rir_iri,但是呢,如果某个职员的直接上司来参加舞会了,那么这个职员就无论如何也不肯来参加舞会了。所以,请你编程计算,邀请哪些职员可以使快乐指数最大,求最大的快乐指数。输入格式输入的第一行是一个整数 nnn。第 222 到第 (n+1)(n +原创 2021-06-13 08:29:17 · 177 阅读 · 0 评论 -
cf Educational Codeforces Round 106 E. Chaotic Merge
原题:E. Chaotic Mergetime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputYou are given two strings x and y, both consist only of lowercase Latin letters. Let |s| be the length of string s.Let’s cal原创 2021-05-25 00:03:18 · 170 阅读 · 0 评论 -
cf Educational Codeforces Round 99 F. String and Operations
原题:F. String and Operationstime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputYou are given a string s consisting of n characters. These characters are among the first k lowercase letters of the原创 2021-01-09 01:34:57 · 151 阅读 · 0 评论 -
poj 3278 Catch That Cow
原题:Catch That CowTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 172001 Accepted: 52611DescriptionFarmer John has been informed of the location of a fugitive cow and wants to catch her immediately. He starts at a point N (0 ≤ N ≤ 100,000)原创 2020-11-01 14:18:08 · 411 阅读 · 0 评论 -
uva 323 Jury Compromise && poj 1015
原题:Jury CompromiseTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 37658 Accepted: 10214 Special JudgeDescriptionIn Frobnia, a far-away country, the verdicts in court trials are determined by a jury consisting of members of the general pub原创 2020-10-18 14:21:54 · 212 阅读 · 0 评论 -
hdoj 1024 Max Sum Plus Plus
原题:Max Sum Plus PlusTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 51200 Accepted Submission(s): 18718Problem DescriptionNow I think you have got an AC in Ignatius.L’s “Max Sum” problem. To b原创 2020-09-26 22:19:04 · 128 阅读 · 0 评论 -
hdoj 4283 You Are the One
原题:You Are the OneTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 7879 Accepted Submission(s): 4002Problem Description The TV shows such as You Are the One has been very popular. In order to原创 2020-09-06 23:58:23 · 152 阅读 · 0 评论 -
leetcode 1139 最大的以 1 为边界的正方形
原题:给你一个由若干 0 和 1 组成的二维网格 grid,请你找出边界全部由 1 组成的最大 正方形 子网格,并返回该子网格中的元素数量。如果不存在,则返回 0。示例 1:输入:grid = [[1,1,1],[1,0,1],[1,1,1]]输出:9示例 2:输入:grid = [[1,1,0,0]]输出:1提示:1 <= grid.length <= 1001 <= grid[0].length <= 100grid[i][j] 为 0 或 1代码:c原创 2020-07-05 17:41:03 · 201 阅读 · 0 评论 -
hdoj 2476 String painter
原题: There are two strings A and B with equal length. Both strings are made up of lower case letters. Now you have a powerful string painter. With the help of the painter, you can change a segment of characters of a string to any other character you want.原创 2020-06-26 16:38:26 · 380 阅读 · 0 评论 -
zoj 3469
原题:When we are focusing on solving problems, we usually prefer to stay in front of computers rather than go out for lunch. At this time, we may call for food delivery.Suppose there are N people livi...原创 2020-04-06 19:31:04 · 233 阅读 · 0 评论 -
LightOJ 1422 Halloween Costumes
原题:Gappu has a very busy weekend ahead of him. Because, next weekend is Halloween, and he is planning to attend as many parties as he can. Since it’s Halloween, these parties are all costume parties,...原创 2020-03-14 23:48:59 · 309 阅读 · 0 评论 -
poj 2955 Brackets
原题:BracketsTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 17392 Accepted: 9010DescriptionWe give the following inductive definition of a “regular brackets” sequence:the empty sequen...原创 2020-03-14 14:57:54 · 143 阅读 · 0 评论 -
ZOJ 3537
原题:You want to hold a party. Here’s a polygon-shaped cake on the table. You’d like to cut the cake into several triangle-shaped parts for the invited comers. You have a knife to cut. The trace of eac...原创 2020-02-25 23:27:28 · 189 阅读 · 0 评论 -
uva 1331
原题:Triangulation of surfaces has applications in the Finite Element Method of solid mechanics. Theobjective is to estimate the stress and strain on complex objects by partitioning them into small si...原创 2020-02-23 01:21:19 · 267 阅读 · 0 评论 -
leetcode 1000 合并石头的最低成本
原题:有 N 堆石头排成一排,第 i 堆中有 stones[i] 块石头。每次移动(move)需要将连续的 K 堆石头合并为一堆,而这个移动的成本为这 K 堆石头的总数。找出把所有石头合并成一堆的最低成本。如果不可能,返回 -1 。示例 1:输入:stones = [3,2,4,1], K = 2输出:20解释:从 [3, 2, 4, 1] 开始。合并 [3, 2],成本为 5,...原创 2020-02-06 20:13:28 · 1037 阅读 · 1 评论 -
leetcode 312 戳气球
原题:有 n 个气球,编号为0 到 n-1,每个气球上都标有一个数字,这些数字存在数组 nums 中。现在要求你戳破所有的气球。每当你戳破一个气球 i 时,你可以获得 nums[left] * nums[i] * nums[right] 个硬币。 这里的 left 和 right 代表和 i 相邻的两个气球的序号。注意当你戳破了气球 i 后,气球 left 和气球 right 就变成了相邻的气...原创 2020-02-06 18:41:26 · 278 阅读 · 1 评论 -
uva 1626
原题:Let us define a regular brackets sequence in the following way:1… Empty sequence is a regular sequence.2 …If S is a regular sequence, then (S) and [S] are both regular sequences.3…If A and B ar...原创 2020-01-26 23:29:08 · 256 阅读 · 0 评论 -
cf Educational Codeforces Round 63 D. Beautiful Array
原题:D. Beautiful Arraytime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputYou are given an array aconsisting of n integers. Beauty of array ...原创 2019-12-22 00:13:31 · 166 阅读 · 0 评论 -
uva 10465 Homer Simpson
uva 10465原创 2015-07-01 13:39:49 · 632 阅读 · 0 评论 -
uva 531 妥协 Compromise
题目大意: 两个政客谈条件,互相提出自己的意见。现在让你编写一个程序,能把他们两个人提出的条件的公共部分找出来,而且尽可能的多,输出任意一组即可。(输入输出有些蹩脚) 思路见代码下端:#include<iostream>#include<algorithm>#include<cstdio>#include<vector>#include<cstring>#include<string>原创 2015-06-30 20:03:07 · 600 阅读 · 0 评论 -
uva 10130 超级甩卖 SuperSale
uva 10130原创 2015-06-30 14:16:13 · 632 阅读 · 0 评论 -
uva 437 The Tower of Babylon 巴比伦塔
uva 437原创 2015-07-12 21:45:06 · 702 阅读 · 0 评论 -
uva 10534 Wavio Sequence XX序列(第一个词不认识)
uva 10534原创 2015-07-17 22:52:32 · 648 阅读 · 0 评论 -
uva 10651 Pebble Solitaire
uva 10651原创 2015-08-27 12:19:05 · 518 阅读 · 0 评论 -
uva 825 Walking on the Safe Side 走安全路线
uva 825原创 2015-07-19 23:17:08 · 844 阅读 · 0 评论 -
uva 10069 Distinct Subsequences 不同的序列
uva 10069原创 2015-07-23 23:45:00 · 3258 阅读 · 1 评论 -
uva 10048 Audiophobia
uva 10048原创 2015-07-06 23:12:26 · 748 阅读 · 0 评论 -
uva 10051 Tower of Cubes 方块塔
uva 10051原创 2015-08-22 21:17:50 · 849 阅读 · 0 评论 -
uva 590 Always on the run 跑路
uva 590原创 2015-10-02 16:55:34 · 1106 阅读 · 0 评论