dp
_leon1999
qaq
展开
-
hdu 2089 不要62 数位dp
不要62 HDU - 2089 #include<iostream>#include<cstdio>#include<cstring>#define LL long longusing namespace std;LL dp[10][10];int a[10];void init(){ dp[0][0]=1;//dp[i][j]代表i位数...原创 2018-06-26 11:04:29 · 151 阅读 · 0 评论 -
hdu 5890 (bitset优化背包)
Eighty sevenHDU - 5890题目大意:给出n个数,删掉任意三个数之后问剩下的数取10个加起来能否等于87。q次询问,每次给三个数,表示删掉的数。由于Q很大,可以预处理。50*50*50每次如果做普通的背包的话是n*k*100考虑的用bitset优化 //dp[i][j]=dp[i-1][j]; //dp[i][j]=dp[i...原创 2019-04-16 15:59:56 · 224 阅读 · 0 评论 -
POJ - 3017 Cut the Sequence (单调栈优化dp)
Cut the SequencePOJ - 3017题目大意:给出一个序列,要我们分成若干段,使得每段的最大值做和最小。同时还给了一个限制,每段的和不能超过m。解题思路:这个题目写起来还真的是细节满满。。。。首先可以得到n^2的dp。设dp[i]为前i个满足要求的最小值。那么对于i.dp[i]=min(dp[j],max(j+1,i)) 其中(0<=j&...原创 2019-04-26 20:55:00 · 206 阅读 · 0 评论 -
FZU - 2302 Necklace (dp+斜率优化)
I - NecklaceFZU - 2302题目大意:给出一个环每一段的价值为区间和的平方,求将环断成k断的最小价值之和。解题思路:容易想到n^4的dp首先断环成链,将数组复制一遍。用dp[i][j]表示前i个分成j断的最小代价,那么我们就枚举区间,枚举段数,没增加一个点,当前点要么独立成一段,要么跟前边的成一段,所以再枚举间断点。由于起点不确定,所以我们要做n次的dp...原创 2019-04-25 12:03:14 · 139 阅读 · 0 评论 -
2019 Multi-University Training Contest 2 Beauty Of Unimodal Sequence
Beauty Of Unimodal SequenceTime Limit: 8000/4000 MS (Java/Others)Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 645Accepted Submission(s): 226Problem DescriptionYou a...原创 2019-08-22 15:15:10 · 110 阅读 · 0 评论 -
2019 Multi-University Training Contest 3 Distribution of books (离散化+线段树优化dp)
Distribution of booksTime Limit: 8000/8000 MS (Java/Others)Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 1324Accepted Submission(s): 514Problem Descriptionzz6d likes r...原创 2019-09-03 15:43:56 · 132 阅读 · 0 评论 -
2019 Multi-University Training Contest 3 Squrirrel (树形dp)
SqurirrelTime Limit: 4000/4000 MS (Java/Others)Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 609Accepted Submission(s): 186Problem DescriptionMaster magician `eom` is ...原创 2019-09-05 14:38:13 · 106 阅读 · 0 评论 -
New Year and Old Subsequence (线段树优化dp)
New Year and Old Subsequencetime limit per test3 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputA stringtis calledniceif a string "2017" occurs ...原创 2019-09-09 12:44:38 · 126 阅读 · 0 评论 -
2019南昌网络赛 Hello 2019 (线段树优化dp)
A digital string is "good": when it contains a subsequence91029102and does not contain a subsequence81028102.The bad value of a string is defined as how many characters are to remove at least, so...原创 2019-09-10 15:57:22 · 290 阅读 · 0 评论 -
2019 Multi-University Training Contest 9 Rikka with Coin (背包+思维)
Rikka with CoinTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 524288/524288 K (Java/Others)Total Submission(s): 1722Accepted Submission(s): 568Problem DescriptionRikka hates coin...原创 2019-09-10 16:54:50 · 210 阅读 · 0 评论 -
基础dp专题结题报告
HDU - 1024#include<iostream>#include<cstdio>#include<cstring>#include<stack>using namespace std;#define pb(x) push_back(x)#define sca(x) scanf("%d",&x)#define inf...原创 2019-04-02 17:28:07 · 146 阅读 · 0 评论 -
区间dp专题解题报告
最近数据结构学傻,先停一下,写会dp冷静一下。LightOJ - 1422#include<iostream>#include<cstdio>#include<cstring>using namespace std;#define pb(x) push_back(x)#define sca(x) scanf("%d",&x)#def...原创 2019-03-27 16:21:30 · 126 阅读 · 0 评论 -
hrbust 2382(数位dp+二分)
极难的问题Time Limit: 1000 MSMemory Limit: 200000 KTotal Submit: 20(9 users)Total Accepted: 6(6 users)Rating: Special Judge: NoDescription那年一个菊苣问了asuka几个问题,把asuka花式吊打。asuka思考了一下,不能光我一个人被吊打啊,于是他决定把这个题出出来。如果...原创 2018-06-26 14:04:40 · 497 阅读 · 0 评论 -
hrbust 1522 子序列的和(RMQ)
子序列的和Time Limit: 1000 MSMemory Limit: 32768 KTotal Submit: 541(111 users)Total Accepted: 121(75 users)Rating: Special Judge: NoDescription输入一个长度为n的整数序列(A1,A2,……,An),从中找出一段连续的长度不超过m的子序列,使得这个子序列的和最大。Inp...原创 2018-07-05 15:51:32 · 201 阅读 · 0 评论 -
洛谷 P1164 小A点菜 (dp)
题目背景uim神犇拿到了uoi的ra(镭牌)后,立刻拉着基友小A到了一家……餐馆,很低端的那种。uim指着墙上的价目表(太低级了没有菜单),说:“随便点”。题目描述不过uim由于买了一些辅(e)辅(ro)书,口袋里只剩MM元(M \le 10000)(M≤10000)。餐馆虽低端,但是菜品种类不少,有NN种(N \le 100)(N≤100),第ii种卖a_iai元(a_i ...原创 2018-09-18 19:09:26 · 214 阅读 · 0 评论 -
ACM-ICPC 2018 焦作赛区网络预赛 Transport Ship (多重背包)
There are NN different kinds of transport ships on the port. The i^{th}ith kind of ship can carry the weight of V[i]V[i] and the number of the i^{th}ith kind of ship is 2^{C[i]} - 12C[i]−1. How many d...原创 2018-09-18 19:53:46 · 153 阅读 · 0 评论 -
hrbust 1359 Leyni的国家II (树形dp)
Leyni的国家II Time Limit: 2000 MS Memory Limit: 262144 K Total Submit: 34(12 users) Total Accepted: 17(11 users) Rating: Special Judge: No Description Le...原创 2018-09-27 23:00:04 · 133 阅读 · 0 评论 -
hdu 5459 (dp)
Jesus Is HereTime Limit: 1500/1000 MS (Java/Others) Memory Limit: 65535/102400 K (Java/Others)Total Submission(s): 912 Accepted Submission(s): 661 Problem DescriptionI've sent Fang Fang ...原创 2018-10-05 22:27:11 · 115 阅读 · 0 评论 -
Knapsack in a Globalized World (dp)
Knapsack in a Globalized World时间限制: 1 Sec 内存限制: 64 MB提交: 118 解决: 38[提交] [状态] [讨论版] [命题人:admin]题目描述Globalization stops at nothing, not even at the good old honest profession of a burglar. Now...原创 2018-10-16 22:43:21 · 248 阅读 · 0 评论 -
zoj 1346 (求满足拓扑排序的序列个数)
Comparing Your Heroes时间限制: 1 Sec 内存限制: 128 MB提交: 9 解决: 6[提交] [状态] [讨论版] [命题人:admin]题目描述Nowadays many students wouldn't attend classes in university, instead, they stay in dormitory playing E...原创 2019-02-26 22:29:29 · 1738 阅读 · 0 评论 -
CodeForces - 766E (树形dp+二进制)
C - Mahmoud and a xor tripCodeForces - 766E补题的时候碰见的一道题目,感觉思路非常巧妙就记录下来了。题目大意:给出n个点,每个点有一个点权,求所有路径的异或和,其中起点必须小于终点。解题思路:我第一反应感觉有点像树分治,但是我不会,如果我们把每一个点权拆成二进制位,把答案分开计算也能得到最终答案。如果我们每个点的值只有0或者1的话,...原创 2019-03-21 13:28:15 · 285 阅读 · 0 评论 -
2019 Multi-University Training Contest 9 Rikka with Travels (树形dp+线段树)
Rikka with TravelsTime Limit: 4000/2000 MS (Java/Others)Memory Limit: 524288/524288 K (Java/Others)Total Submission(s): 707Accepted Submission(s): 241Problem DescriptionTo enjoy their...原创 2019-09-12 17:59:57 · 168 阅读 · 0 评论