dp
newhonor
可以不伟大,但不能卑微
展开
-
E. Yet Another Division Into Teams
http://codeforces.com/contest/1256/problem/E#include <bits/stdc++.h>//#include <queue>//#include <cmath>//#include <iostream>//#include <unordered_map>#define ls...原创 2019-11-05 22:35:56 · 165 阅读 · 0 评论 -
D. Sequence Sorting
http://codeforces.com/contest/1241/problem/D#include <bits/stdc++.h>//#include <queue>//#include <cmath>//#include <iostream>//#include <unordered_map>#define ls...原创 2019-11-05 16:30:48 · 251 阅读 · 0 评论 -
D. Paint the Tree
http://codeforces.com/contest/1244/problem/D#include <bits/stdc++.h>//#include <queue>//#include <cmath>//#include <iostream>//#include <unordered_map>#define ls...原创 2019-11-03 20:59:38 · 178 阅读 · 0 评论 -
E. By Elevator or Stairs?
http://codeforces.com/contest/1249/problem/E#include <bits/stdc++.h>#include <queue>//#include <cmath>//#include <iostream>//#include <unordered_map>#define lson...原创 2019-11-03 12:40:59 · 120 阅读 · 0 评论 -
C. Ivan the Fool and the Probability Theory
http://codeforces.com/contest/1248/problem/C#include <bits/stdc++.h>//#include <cmath>//#include <iostream>//#include <unordered_map>#define mem(x,y) memset(x,y,size...原创 2019-11-01 12:28:53 · 204 阅读 · 0 评论 -
Distribution of books
http://acm.hdu.edu.cn/showproblem.php?pid=6606#include <iostream>#include <cstring>#include <queue>#include <vector>#include <algorithm>#include <cstdio>#...原创 2019-10-15 10:35:08 · 148 阅读 · 0 评论 -
Count The Bits Gym - 101982D
https://cn.vjudge.net/problem/Gym-101982D#include <iostream>#include <cstring>#include <queue>#include <vector>#include <algorithm>#include <cstdio>#inclu...原创 2019-08-17 19:40:39 · 89 阅读 · 0 评论 -
Contest Setting Gym - 101982C
https://cn.vjudge.net/problem/Gym-101982C思路:离散化等级;dp[i][j]表示取到第i个等级,共取了j个;每个取或不取就是背包;#include <iostream>#include <cstring>#include <queue>#include <vector>#include &...原创 2019-08-17 16:30:46 · 117 阅读 · 0 评论 -
Secret of Chocolate Poles Gym - 101986A
https://cn.vjudge.net/problem/Gym-101986A思路:dp[i][j]表示i(0/1)顶是黑还是白,j表示当前长度;#include <iostream>#include <cstring>#include <queue>#include <vector>#include <algorithm...原创 2019-08-13 10:01:12 · 147 阅读 · 0 评论 -
P1004 方格取数
https://www.luogu.org/problem/P1004思路:dp[i][j][k][z]表示第一个在(i,j),第二个在(k,z);#include <iostream>#include <cstring>#include <queue>#include <vector>#include <algorith...原创 2019-08-12 22:13:00 · 76 阅读 · 0 评论 -
Comet OJ - Contest #6 双倍快乐
https://www.cometoj.com/contest/48/problem/B思路:dp[i][j] 表示:一段i结尾,一段j结尾最大值;#include <iostream>#include <cstring>#include <algorithm>#include <cstdio>#include <queue&...原创 2019-08-10 10:51:51 · 169 阅读 · 0 评论 -
Comet OJ - Contest #8 符文能量
https://www.cometoj.com/contest/58/problem/C?problem_id=2760思路:手动模拟发现无论从哪里开始结果一样;dp[i][j][k]表示第i个元组j(0/1)变不变化,k表示变化的连续段次数(0/1);#include <iostream>#include <cstring>#include <a...原创 2019-08-10 09:35:22 · 314 阅读 · 0 评论 -
Making the Grade
https://ac.nowcoder.com/acm/contest/997/F思路:dp[i][j]表示第i个变成第j个的前i个最小花费;因为要取前面最小更新,故sort一下保证前面尽量小;#include <iostream>#include <cstring>#include <queue>#include <vector>...原创 2019-08-02 10:04:33 · 236 阅读 · 0 评论 -
ABBA
https://ac.nowcoder.com/acm/contest/881/E思路:dp[i][j]表示:i个A,j个B;放A前必须有n个B与前面的A匹配,不然AB会变多,不符合;同理B一样;#include <iostream>#include <cstring>#include <queue>#include <vector&g...原创 2019-08-02 17:55:38 · 132 阅读 · 0 评论 -
Running
https://ac.nowcoder.com/acm/contest/1069/J思路:dp[i][j]表示i时刻j因子;#include <iostream>#include <cstring>#include <queue>#include <vector>#include <algorithm>#includ...原创 2019-07-29 16:42:17 · 159 阅读 · 0 评论 -
Uberwatch Gym - 101873I
https://cn.vjudge.net/problem/Gym-101873I#include <iostream>#include <cstring>#include <queue>#include <vector>#include <algorithm>#include <cstdio>#inclu...原创 2019-08-30 16:59:02 · 120 阅读 · 0 评论 -
Joyride Gym - 101873C
https://cn.vjudge.net/problem/Gym-101873C#include <iostream>#include <cstring>#include <queue>#include <vector>#include <algorithm>#include <cstdio>#inclu...原创 2019-08-30 19:25:37 · 304 阅读 · 0 评论 -
Commandos Gym - 101147H
https://vjudge.net/problem/Gym-101147H#include <iostream>#include <cstring>#include <queue>#include <vector>#include <algorithm>#include <cstdio>#include ...原创 2019-09-06 19:28:22 · 91 阅读 · 0 评论 -
Weather Station Gym - 101243D
https://cn.vjudge.net/problem/Gym-101243D#include <iostream>#include <cstring>#include <queue>#include <vector>#include <algorithm>#include <cstdio>#includ...原创 2019-10-08 15:57:28 · 86 阅读 · 0 评论 -
Zigzag Gym - 101291M
https://cn.vjudge.net/problem/Gym-101291M#include <iostream>#include <cstring>#include <queue>#include <vector>#include <algorithm>#include <cstdio>#includ...原创 2019-10-06 17:17:58 · 180 阅读 · 0 评论 -
Alphabet Gym - 101291A
https://cn.vjudge.net/problem/Gym-101291A#include <iostream>#include <cstring>#include <queue>#include <vector>#include <algorithm>#include <cstdio>#includ...原创 2019-10-06 16:21:00 · 114 阅读 · 0 评论 -
Invoker
http://acm.hdu.edu.cn/showproblem.php?pid=6739#include <iostream>#include <cstring>#include <queue>#include <vector>#include <algorithm>#include <cstdio>#...原创 2019-09-28 20:32:14 · 293 阅读 · 0 评论 -
Comet OJ - Contest #11 usiness
https://www.cometoj.com/contest/67/problem/B?problem_id=3796dp[i][j] 表示第i天有j钱,最后最多能有多少钱;#include <iostream>#include <cstring>#include <queue>#include <vector>#includ...原创 2019-09-27 18:40:19 · 113 阅读 · 0 评论 -
Generating Texts Gym - 101845G
https://cn.vjudge.net/problem/Gym-101845G#include <iostream>#include <cstring>#include <queue>#include <vector>#include <algorithm>#include <cstdio>#inclu...原创 2019-09-24 16:10:13 · 130 阅读 · 0 评论 -
Keep Your Style Gym - 101845K
https://cn.vjudge.net/problem/Gym-101845K#include <iostream>#include <cstring>#include <queue>#include <vector>#include <algorithm>#include <cstdio>#inclu...原创 2019-09-23 20:28:36 · 118 阅读 · 0 评论 -
Mr. Panda and Birthday Song Gym - 101775H
https://cn.vjudge.net/problem/Gym-101775H#include <iostream>#include <cstring>#include <queue>#include <vector>#include <algorithm>#include <cstdio>#inclu...原创 2019-09-17 11:30:21 · 135 阅读 · 0 评论 -
The Preliminary Contest for ICPC Asia Xuzhou 2019 Random Access Iterator
https://nanti.jisuanke.com/t/41392dp[i] 表示节点i到端点失败的概率;反思:概率不会算,就是每个子节点都会随机选择,所以做size次决策,所以时size的次方;#include <iostream>#include <cstring>#include <queue>#include <vector&...原创 2019-09-11 15:49:30 · 121 阅读 · 0 评论 -
P2569 [SCOI2010]股票交易
https://www.luogu.org/problemnew/show/P2569总结:单调队列优化dp;没初始化i==0时,第二种情况会出错~~~;#include<algorithm>#include<set>#include<cmath>#include<cstring>#include<iostream>...原创 2019-07-11 19:10:04 · 262 阅读 · 0 评论 -
Evolution Game
http://codeforces.com/gym/102091思路:dp[i]表示第j大最大进化次数;#include<algorithm>#include<set>#include<cmath>#include<cstring>#include<iostream>#include<set>#inclu...原创 2019-07-10 10:54:24 · 110 阅读 · 0 评论 -
F. Tickets
http://codeforces.com/gym/101911/problem/F题意:给一个六位的串问比这个数小的且这些数的前三位数与后三位数差值 的绝对值比这个数小的一共有多少个;思路:(1):dp[i]表示前i个数满足条件的个数,从1~1e6枚举,每次记录差值,并加上比它差值小的个数;(2):树状数组枚举1~1e6,更新前后差值个数和查询个数;#include<a...原创 2019-04-08 20:27:15 · 221 阅读 · 0 评论 -
Building Shops
题意:有一些教室,可以在这些位置建立超市,建立费用ci;不建花费就是其最左边超市的距离d;思路:dp;不建立的地方到其最左边的超市之间全部都没建超市的!!!,要加上他们距离的和;map没开longlong哇~~#include<algorithm>#include<set>#include<vector>#include<queue>...原创 2019-04-02 20:00:10 · 153 阅读 · 0 评论 -
HihoCoder - 1617
题意:给定一个NxN的方格矩阵,每个格子中都有一个整数Aij。小Hi和小Ho各自选择一条从左上角格子到右下角格子的路径,要求路径中每一步只能向右或向下移动,并且两条路径不能相交(除了左上右下起止方格)。 现在将两条路径经过的整数加起来求和。你能计算出这个和最大是多少吗?思路:dp;2*n步俩个人都做完,所以一维是步数每次缺上一步最优来更新当前这步;第二维是第一个人走了多少横坐标方向的...原创 2019-04-01 17:21:45 · 207 阅读 · 0 评论 -
Zipper
http://acm.hdu.edu.cn/showproblem.php?pid=1501题意:给出三个串,问是否第三个能用前两个表示,且他们的顺序不变,可以打乱;思路:dfs: 要记忆化搜索,标记s1,s2完成了匹配的位置vis[cnt1][cnt2],因为值两个位置前无论再怎么组合都可以匹配出两个串的两部分; dp:dp[i][j]=true,表示s1前i...原创 2019-03-26 19:41:51 · 512 阅读 · 0 评论 -
C. Hard problem
http://codeforces.com/problemset/problem/706/C题意:给出每个串反转的花费,问最小花费使得这些串按字典序排序;思路:dp;dp[i][0/1] 表示的i个串反转(1)还不反转(0)的最小花费;#include<algorithm>#include<set>#include<vector>#inclu...原创 2019-03-18 19:21:04 · 388 阅读 · 0 评论 -
D. Flowers
http://codeforces.com/problemset/problem/474/D题意:土拔鼠可以吃红或白花,但白花只能在连续k个白花时才吃百花(一开始没读出这句话=-=);n个询问a,b问a~b朵花的序列中有多少种吃法;思路:dp;dp[i]=dp[i-1]+dp[i-k];打表;然后求前缀和;总结:sum[b]-sum[a-1]没有加mod再mod会出现负数!!#i...原创 2019-03-11 19:38:44 · 376 阅读 · 1 评论 -
E. Tetrahedron
http://codeforces.com/contest/166/problem/E#include<algorithm>#include<set>#include<vector>#include<queue>#include<cmath>#include<cstring>#include<iostr...原创 2019-03-15 20:43:05 · 239 阅读 · 0 评论 -
B. Mashmokh and ACM
http://codeforces.com/problemset/problem/414/B题意:在1~n数字内组合长度为k的数组,使得a[i]能被a[i+1]整除的所有情况;思路: dp[len][num]表示长度len结尾为数字num的情况数目;总结:dp状态不怎么会使用;初步感觉在一个状态A递推下,在其他状态下暴力枚举这些状态的情况,使得状态A最优,然后处理A下一个状态;总之就...原创 2019-03-14 22:39:39 · 210 阅读 · 0 评论 -
C. k-Tree
http://codeforces.com/problemset/problem/431/C题意:一颗完全k叉树,边权1~k;问路径权和为n且至少包含一条路权不小于d的路劲有多少;思路:dp;dp[i][j]表示总和i,第一维类似完全背包, 第二维判断是否满足d条件;#include<algorithm>#include<set>#include<...原创 2019-03-10 19:03:56 · 320 阅读 · 0 评论 -
C. Woodcutters
http://codeforces.com/problemset/problem/545/C题意:n棵树,可以砍或不砍,可以倒向左或右;问最多可以看多少棵树;思路:dp;dp值为当前最大的可以砍的树的数量;dp[i][0]表示不砍,dp[i][1]表示向左倒,dp[i][2]向右倒;向左倒时,上一棵可能可以向右倒;总结:没开long long,INF没处理到边界!!#inclu...原创 2019-03-10 16:14:32 · 582 阅读 · 0 评论 -
A. Vacations
http://codeforces.com/problemset/problem/698/A题意:有n天,0休息,1运动,2比赛,3可以运动或比赛;(每天都可以选择休息);问最少的休息天数;思路:dp;找到最大的非休息天数k;ans=n-k; dp[i][0]第i天休息,dp[i][1]运动,dp[i][2]比赛;维护最大的非休息数目;#include<algorithm&g...原创 2019-03-10 11:23:54 · 297 阅读 · 0 评论