dp
XiWenjuan086
这个作者很懒,什么都没留下…
展开
-
Educational Codeforces Round 108 (Rated for Div. 2) D. Maximum Sum of Products(简单dp)
题意:给a、b两个数组,可以将数组a的一段连续子序列反转,求的最大值思路:定义为数组a反转[i, j]区间后,这段区间对应位置的乘积之和,有转移方程:然后n ^ 2取最大值即可#include<bits/stdc++.h>using namespace std;typedef long long ll;const int N = 5007;const int M = 2e6 + 7;const int inf = 0x3f3f3f3f;const int ...原创 2021-05-02 18:14:34 · 125 阅读 · 0 评论 -
计蒜客 - 42397 2019ICPC南京 C - Digital Path (记忆化搜索)
Zhe the bully, is condemned by all kinds of evil, like bullying those who are weaker. His teammates have been mistreated for a long time. Finally, they decided not to put up with their buddy any more and flee to Digital Village, with the bully in hot pursu原创 2020-12-09 19:39:22 · 485 阅读 · 1 评论 -
HDU - 5534 Partial Tree (完全背包)
In mathematics, and more specifically in graph theory, a tree is an undirected graph in which any two nodes are connected by exactly one path. In other words, any connected graph without simple cycles is a tree.You find a partial tree on the way home. Th.原创 2020-11-20 17:25:54 · 130 阅读 · 0 评论 -
HDU - 4597 Play Game (博弈 + 区间dp)
Alice and Bob are playing a game. There are two piles of cards. There are N cards in each pile, and each card has a score. They take turns to pick up the top or bottom card from either pile, and the score of the card will be added to his total score. Alice原创 2020-11-18 19:50:29 · 175 阅读 · 0 评论 -
2017ccpc杭州 E. Master of Subgraph(点分治 + 树dp + bitset)
题意:给定一棵 n 个点的树,每个点有一个权值 w[i],现在我们可以选一些连通的点,并且把这点选出来的点的权值相加,得到一个和。求 [1, m] 里面哪些值可以被表示成选出来的点的权值和。用0101序列的方式输出。思路:考虑点分治。先选出树的重心,考虑一定要选这个点的答案。假设我选择了某个点,那么我必须选择这个点的父亲。现在开始递归这棵树。每次递归到一个点,这个点的bitset初值化为父亲结点表示的bitset右移w[x]位。他的意义是,当前这个点如果选了,那么他的父亲必选,那也就是求他父...原创 2020-11-11 20:04:15 · 247 阅读 · 0 评论 -
2020ICPC·小米 网络选拔赛第二场 I Subsequence Pair(dp)
链接:https://ac.nowcoder.com/acm/contest/7502/I来源:牛客网时间限制:C/C++ 1秒,其他语言2秒空间限制:C/C++ 262144K,其他语言524288K64bit IO Format: %lld题目描述Bobo has two strings s and t. He would like to choose two subsequences x from s and y from t such that:+ x is lexicogr.原创 2020-11-05 11:29:23 · 231 阅读 · 0 评论 -
2020ICPC·小米 网络选拔赛第二场 H Knapsack(超大01背包)
链接:https://ac.nowcoder.com/acm/contest/7502/H来源:牛客网时间限制:C/C++ 3秒,其他语言6秒空间限制:C/C++ 262144K,其他语言524288K64bit IO Format: %lld题目描述Bobo has n items, where the i-th item has weight wiw_iwi and value viv_ivi. He wants to pick some items whose sum of .原创 2020-11-04 20:48:09 · 418 阅读 · 0 评论 -
第45届国际大学生程序设计竞赛(ICPC)亚洲网上区域赛模拟赛 E Eat Walnuts(区间dp)
链接:https://ac.nowcoder.com/acm/contest/8688/E来源:牛客网时间限制:C/C++ 2秒,其他语言4秒空间限制:C/C++ 65536K,其他语言131072K64bit IO Format: %lld题目描述As we all know, in the ACM ICPC held in 2017, the organizer of Xinjiang University presented a box of walnuts to each coac原创 2020-11-03 19:11:56 · 1474 阅读 · 0 评论 -
换根dp
讲解转自https://boctorio.com/2019/07/22/%E6%8D%A2%E6%A0%B9dp/?tdsourcetag=s_pctim_aiomsg换根dp是一种用来求解树上各点到其他点的距离之和的算法。在进行换根dp时,需要先利用dfs 计算出根节点到其他节点的距离之和,以及以每个节点为根节点的子树的节点数量。然后再对其进行换根dp。以下假设每条边的长度为1。Part1:计算根节点到其他节点距离之和我们在求解时利用递归的思想进行求解:假设a为根节点,b为直..原创 2020-10-30 16:49:29 · 720 阅读 · 0 评论 -
2020ccpc威海 L Clock Master(数论 + 分组背包)
LClock MasterWith the rapid development of society, the demand for high-precision clocks is constantly rising. Recently, the China Clock Production Company is developing a new type of clock, which can represent a wide range of times.The novel clock di.原创 2020-10-30 10:36:43 · 765 阅读 · 0 评论 -
2020ICPC·小米 网络选拔赛第一场 A Intelligent Warehouse(dp)
链接:https://ac.nowcoder.com/acm/contest/7501/A来源:牛客网时间限制:C/C++ 1秒,其他语言2秒空间限制:C/C++ 262144K,其他语言524288K64bit IO Format: %lld题目描述In MI Intelligent Warehouse, there are nn_{}n products, where the ii_{}i-th product is of size aia_iai. We always ne.原创 2020-10-26 14:39:54 · 415 阅读 · 2 评论 -
AtCoder - ARC105_C Camels and Bridge (dp + 二分)
Problem StatementThere areNNcamels numbered11throughNN.The weight of Cameliiiswiwi.You will arrange the camels in a line and make them cross a bridge consisting ofMMparts.Before they cross the bridge, you can choose their order in the ...原创 2020-10-20 22:07:14 · 1527 阅读 · 0 评论 -
HDU - 6549 String (前缀优化dp)
wls 有一个长度为nn的字符串,每次他可以将一个长度不大于ll的子串修改成同一种字母,问至少修改多少次可以使字符串最多含有kk段。连续的只含同 一种字母的子串被称为一段。比如说,aaabbccaaa共含有 4 段。Input第一行三个整数n,l,k。第二行一个字符串。1 ≤n≤ 100, 0001 ≤l≤ 100, 0001 ≤k≤ 10Output一行一个数表示答案。Sample Input3 1 1babSample Ou...原创 2020-10-20 21:29:37 · 347 阅读 · 1 评论 -
HDU - 6558 D - The Moon (概率dp)
The Moon card shows a large, full moon in the night’s sky, positioned between two large towers. The Moon is a symbol of intuition, dreams, and the unconscious. The light of the moon is dim, compared to the sun, and only vaguely illuminates the path to high原创 2020-10-12 16:39:46 · 963 阅读 · 2 评论 -
牛客练习赛71 C数学考试(思维 + dp)
链接:https://ac.nowcoder.com/acm/contest/7745/C来源:牛客网数学考试时间限制:C/C++ 1秒,其他语言2秒空间限制:C/C++ 262144K,其他语言524288K64bit IO Format: %lld题目描述牛牛在树剖姐姐的数学考试里出了一个题,但是树剖姐姐不会做,于是她向您求助。求 1∼n1\sim n1∼n的排列,有 m 个限制条件,第i个限制条件 pip_ipi表示前 pip_ipi个数不能是 1∼pi1\si...原创 2020-10-10 13:34:26 · 259 阅读 · 0 评论 -
HDU - 6739 Invoker (dp)
In dota2, there is a hero named Invoker. He has 3 basic skills in the game, which are Quas, Wex and Exort. Once he launches a basic skill, he will gain the corresponding element, where Quas gives "Q", Wex gives "W" and Exort gives "E".Invoker can't have .原创 2020-10-01 23:51:42 · 214 阅读 · 0 评论 -
HDU - 6446 Tree and Permutation (树形dp)
There areNNvertices connected byN−1N−1edges, each edge has its own length.The set {1,2,3,…,N1,2,3,…,N} contains a total ofN!N!unique permutations, let’s say theii-th permutation isPiPiandPi,jPi,jis itsjj-th number.For theii-th permutatio...原创 2020-09-24 15:02:44 · 181 阅读 · 0 评论 -
HDU - 6567 Cotree(树的重心 + 树形dp)
Avin has two trees which are not connected. He asks you to add an edge between them to make them connected while minimizing the function∑ni=1∑nj=i+1dis(i,j)∑i=1n∑j=i+1ndis(i,j), wheredis(i,j)dis(i,j)represents the number of edges of the path fromiito...原创 2020-09-24 14:56:54 · 273 阅读 · 0 评论 -
CodeForces - 1407D Discrete Centrifugal Jumps (单调栈 + dp)
There arennbeautiful skyscrapers in New York, the height of theii-th one ishihi. Today some villains have set on fire firstn−1n−1of them, and now the only safety building isnn-th skyscraper.Let's call a jump fromii-th skyscraper tojj-th (i<ji...原创 2020-09-23 15:51:30 · 261 阅读 · 0 评论 -
HDU - 5834 Magic boy Bi Luo with his excited tree (树形dp)
Bi Luo is a magic boy, he also has a migic tree, the tree hasNNnodes , in each node , there is a treasure, it's value isV[i]V[i], and for each edge, there is a costC[i]C[i], which means every time you pass the edgeii, you need to payC[i]C[i].You m...原创 2020-09-09 16:17:54 · 177 阅读 · 0 评论 -
LuoguP1352 没有上司的舞会(树形dp)
题目描述某大学有nn个职员,编号为1\ldots n1…n。他们之间有从属关系,也就是说他们的关系就像一棵以校长为根的树,父结点就是子结点的直接上司。现在有个周年庆宴会,宴会每邀请来一个职员都会增加一定的快乐指数r_iri,但是呢,如果某个职员的直接上司来参加舞会了,那么这个职员就无论如何也不肯来参加舞会了。所以,请你编程计算,邀请哪些职员可以使快乐指数最大,求最大的快乐指数。输入格式输入的第一行是一个整数nn。第22到第(n + 1)(n+1)行,每行一个整...原创 2020-09-08 19:12:58 · 175 阅读 · 0 评论 -
[HAOI2016]食物链(拓扑排序 + dp)
链接:https://ac.nowcoder.com/acm/problem/20000来源:牛客网时间限制:C/C++ 1秒,其他语言2秒空间限制:C/C++ 262144K,其他语言524288K64bit IO Format: %lld题目描述如图所示为某生态系统的食物网示意图,据图回答第1小题现在给你n个物种和m条能量流动关系,求其中的食物链条数。物种的名称为从1到n编号M条能量流动关系形如a1 b1a2 b2a3 b3......am-1 bm.原创 2020-07-06 17:10:03 · 991 阅读 · 0 评论 -
NK996D 最短Hamilton路径(状压dp)
链接:https://ac.nowcoder.com/acm/contest/996/D来源:牛客网题目描述给定一张 n(n≤20)(n \leq 20)(n≤20) 个点的带权无向图,点从0∼n−10 \sim n-10∼n−1标号,求起点 0 到终点 n-1 的最短Hamilton路径。 Hamilton路径的定义是从 0 到 n-1 不重不漏地经过每个点恰好一次。输入描述:第一行一个整数n。接下来n行每行n个整数,其中第i行第j个整数表示点i到j的距离(一个不超过10710^.原创 2020-07-06 13:35:46 · 285 阅读 · 0 评论 -
HRBUST - 1819 石子合并问题--圆形版 (区间dp)
在圆形操场上摆放着一行共n堆的石子。现要将石子有序地合并成一堆。规定每次只能选相邻的两堆合并成新的一堆,并将新的一堆石子数记为该次合并的得分。请编辑计算出将n堆石子合并成一堆的最小得分和将n堆石子合并成一堆的最大得分。Input输入有多组测试数据。每组第一行为n(n<=100),表示有n堆石子,。二行为n个用空格隔开的整数,依次表示这n堆石子的石子数量ai(0<ai<=100)Output每组测试数据输出有一行。输出将n堆石子合并成一堆的最小得分和将n堆石子合并成一原创 2020-05-27 18:17:16 · 215 阅读 · 0 评论 -
codeforces1341 D. Nastya and Scoreboard(dp + 贪心)
D. Nastya and Scoreboardtime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputDenis, after buying flowers and sweets (you will learn ab...原创 2020-04-26 18:34:18 · 281 阅读 · 0 评论 -
ICPC North America Qualifier Contest 2015 D. Circuit Counting(dp)
Suppose you are given a sequence ofNNinteger-valued vectors in the plane(x_i,y_i)(xi,yi),i=1,\dots,Ni=1,…,N. Beginning at the origin, we can generate a path by regarding each vector as a displac...原创 2020-04-21 18:50:10 · 341 阅读 · 0 评论 -
HDU - 2859 Phalanx (dp_最大对称子图)
Today is army day, but the servicemen are busy with the phalanx for the celebration of the 60th anniversary of the PRC.A phalanx is a matrix of size n*n, each element is a character (a~z or A~Z), sta...原创 2020-04-05 22:06:42 · 179 阅读 · 0 评论 -
HDU - 1078 FatMouse and Cheese (dfs + dp)
FatMouse has stored some cheese in a city. The city can be considered as a square grid of dimension n: each grid location is labelled (p,q) where 0 <= p < n and 0 <= q < n. At each grid lo...原创 2020-04-05 21:02:54 · 174 阅读 · 0 评论 -
POJ - 3186 Treats for the Cows (区间dp)
FJ has purchased N (1 <= N <= 2000) yummy treats for the cows who get money for giving vast amounts of milk. FJ sells one treat per day and wants to maximize the money he receives over a given p...原创 2020-03-31 23:07:39 · 137 阅读 · 0 评论 -
POJ - 1661 Help Jimmy (dp)
"Help Jimmy" 是在下图所示的场景上完成的游戏。场景中包括多个长度和高度各不相同的平台。地面是最低的平台,高度为零,长度无限。Jimmy老鼠在时刻0从高于所有平台的某处开始下落,它的下落速度始终为1米/秒。当Jimmy落到某个平台上时,游戏者选择让它向左还是向右跑,它跑动的速度也是1米/秒。当Jimmy跑到平台的边缘时,开始继续下落。Jimmy每次下落的高度不能超过MAX米...原创 2020-03-29 23:22:25 · 147 阅读 · 0 评论 -
HDU - 5418 Victor and World (TSP问题求最小哈密顿回路 floyd + 状压dp)
After trying hard for many years, Victor has finally received a pilot license. To have a celebration, he intends to buy himself an airplane and fly around the world. There are nn countries on the eart...原创 2020-03-25 16:23:40 · 489 阅读 · 0 评论 -
HDU - 1074 Doing Homework(状压dp)
Ignatius has just come back school from the 30th ACM/ICPC. Now he has a lot of homework to do. Every teacher gives him a deadline of handing in the homework. If Ignatius hands in the homework after th...原创 2020-03-25 12:48:14 · 215 阅读 · 0 评论 -
Arab Collegiate Programming Contest 2015 I. Problem I. Journey(dp)
One day, Homer was bored in his house and decided to go in a journey to discover the lands of Springfield.The lands of Springfield is an infinite grid. Homer's house is located at cell (0, 0) and his ...原创 2020-03-23 22:19:07 · 170 阅读 · 0 评论 -
Benelux Algorithm Programming Contest 2019 H. Historic Exhibition(思维)
The Benelux Artistic Pottery Consortium is preparing for an exhibit of its most prized urns and vases at a gallery in Nijmegen. Due to the sheer number of vases to be put on display the gallery has tr...原创 2020-03-23 15:44:20 · 245 阅读 · 0 评论 -
Benelux Algorithm Programming Contest 2019 E. Efficient Exchange(dp)
You have recently acquired a new job at the Bank for Acquiring Peculiar Currencies. Here people can make payments, and deposit or withdraw money in all kinds of strange currencies. At your first day o...原创 2020-03-22 19:10:08 · 230 阅读 · 0 评论 -
HDU - 1114 Piggy-Bank(dp_完全背包)
Before ACM can do anything, a budget must be prepared and the necessary financial support obtained. The main income for this action comes from Irreversibly Bound Money (IBM). The idea behind is simple...原创 2020-03-17 21:39:05 · 141 阅读 · 0 评论 -
HDU - 1176 免费馅饼(dp_数塔)
都说天上不会掉馅饼,但有一天gameboy正走在回家的小径上,忽然天上掉下大把大把的馅饼。说来gameboy的人品实在是太好了,这馅饼别处都不掉,就掉落在他身旁的10米范围内。馅饼如果掉在了地上当然就不能吃了,所以gameboy马上卸下身上的背包去接。但由于小径两侧都不能站人,所以他只能在小径上接。由于gameboy平时老呆在房间里玩游戏,虽然在游戏中是个身手敏捷的高手,但在现实中运动神经特别迟钝...原创 2020-03-17 00:15:15 · 189 阅读 · 0 评论 -
HDU - 1024 Max Sum Plus Plus(dp_最大M字段和)
Now I think you have got an AC in Ignatius.L's "Max Sum" problem. To be a brave ACMer, we always challenge ourselves to more difficult problems. Now you are faced with a more difficult problem.Given ...原创 2020-03-16 21:29:39 · 131 阅读 · 0 评论 -
POJ - 1458 Common Subsequence(dp_最长公共子序列)
A subsequence of a given sequence is the given sequence with some elements (possible none) left out. Given a sequence X = < x1, x2, ..., xm > another sequence Z = < z1, z2, ..., zk > is a ...原创 2020-03-16 16:19:24 · 138 阅读 · 0 评论 -
中国石油大学ACM俱乐部开放训练赛---问题A: sciorz画画(凸多边形最优三角剖分)
问题 A: sciorz画画时间限制: 1 Sec内存限制: 128 MB提交: 845解决: 159[状态] [提交] [命题人:外部导入]题目描述众所周知,sciorz会画画。某天,sciorz画了一个凸多边形,这个多边形的每个顶点都有一个权值a[i]。sciorz觉得这个凸多边形不够美丽,于是他决定在n个点之间连线,最终用n-3条不相交的线将这个凸n边形分割成n-2个...原创 2020-03-09 09:21:55 · 263 阅读 · 0 评论