DP
DP
invoKer-
这个作者很懒,什么都没留下…
展开
-
CodeForces - 31E TV Game【DP】
题目链接:https://codeforces.com/contest/31/problem/E思路来自洛谷@Binary_Search_Treedp[i][j]表示第i位到第n位中A选了j位的最大A+B#include <iostream>#include <cstdio>#include <cstdlib>#include <cctype>#include <cmath>#include <climits>#inc原创 2021-04-30 16:49:21 · 158 阅读 · 1 评论 -
CodeForces - 30C Shooting Gallery【DP】
题目链接:https://codeforces.com/contest/30/problem/C#include <iostream>#include <cstdio>#include <cstdlib>#include <cctype>#include <cmath>#include <climits>#include <cstring>#include <vector>#include &l原创 2021-02-15 21:14:31 · 116 阅读 · 0 评论 -
CodeForces - 28D Don‘t fear, DravDe is kind【DP】
题目链接:https://codeforces.com/contest/28/problem/D思路来自洛谷题解用map存转移的位置,优化 O(n2)O(n^2)O(n2) 的DP。#include <iostream>#include <map>using namespace std;static const int MAXN=2e5+10;map<int,int> ghs[MAXN];int dp[MAXN],nxt[MAXN],n,head;int原创 2021-02-09 16:17:14 · 256 阅读 · 0 评论 -
CodeForces - 28C Bath Queue【DP】
题目链接:https://codeforces.com/contest/28/problem/C#include <iostream>#include <algorithm>using namespace std;typedef long double db;static const int MAXN=50+10;db dp[MAXN][MAXN][MAXN];int a[MAXN];db C[MAXN][MAXN];int n,m;void init(){原创 2021-01-27 17:21:33 · 187 阅读 · 0 评论 -
CodeForces - 24D Broken robot【期望DP】
题目链接:https://codeforces.com/contest/24/problem/D#include <iostream>using namespace std;typedef double db;static const int MAXN=1000+10;db dp[MAXN][MAXN];int n,m,x,y;int main(){ scanf("%d%d%d%d",&n,&m,&x,&y); for(int i=原创 2020-11-05 15:06:31 · 136 阅读 · 0 评论 -
CodeForces - 23E Berland collider【树形DP】【高精度】
题目链接:https://codeforces.com/contest/23/problem/E#include <iostream>#include <vector>using namespace std;static const int MAXN=700+10;vector<int> mul(vector<int> &A, int b){ vector<int> C; for (int i = 0, t =原创 2020-11-03 16:21:24 · 125 阅读 · 0 评论 -
CodeForces - 21D Traveling Graph【状压DP】【欧拉回路】
题目链接:https://codeforces.com/contest/21/problem/D#include <iostream>#include <cstring>#include <algorithm>using namespace std;static const int MAXN=15;int f[MAXN][MAXN],d[MAXN];int dp[1<<MAXN];int n,m,u,v,w;int ans;int main原创 2020-10-27 14:25:38 · 96 阅读 · 0 评论 -
CodeForces - 19B Checkout Assistant【DP】
题目链接:https://codeforces.com/contest/19/problem/B#include <iostream>#include <cstring>#include <algorithm>using namespace std;static const int MAXN=2e3+10;int n;long long dp[MAXN*2];int t[MAXN],c[MAXN];int main(){ scanf("%d",原创 2020-10-15 21:55:17 · 218 阅读 · 0 评论 -
CodeForces - 18E Flag 2【DP】
题目链接:https://codeforces.com/contest/18/problem/E#include <iostream>#include <cstring>using namespace std;static const int MAXN=500+10;static const int MAXM=26+3;int val[MAXN][MAXM][MAXM];int dp[MAXN][MAXM][MAXM];int path[MAXN][MAXM][MAX原创 2020-10-14 18:32:46 · 97 阅读 · 0 评论 -
CodeForces - 18D Seller Bob【高精度】【DP】
题目链接:https://codeforces.com/contest/18/problem/D#include <iostream>#include <cstring>#include <vector>using namespace std;static const int MAXN=5000+10;vector<int> f[MAXN];vector<int> dp[MAXN];vector<int> add(vec原创 2020-10-14 14:25:03 · 157 阅读 · 0 评论 -
CodeForces - 17C Balance【DP】
题目链接:https://codeforces.com/contest/17/problem/C#include <iostream>#include <cmath>using namespace std;static const int MOD=51123987;static const int MAXN=150+10;char s[MAXN];int p[MAXN][3];int dp[MAXN][55][55][55];int n,res;int main(原创 2020-10-06 15:21:51 · 232 阅读 · 0 评论 -
CodeForces - 16E Fish【状压DP】
题目链接:https://codeforces.com/contest/16/problem/E#include <iostream>using namespace std;typedef double db;static const int MAXN=20;db dp[1<<MAXN],a[MAXN][MAXN];int n;int main(){ scanf("%d",&n); for(int i=0;i<n;i++)原创 2020-10-05 20:10:21 · 129 阅读 · 0 评论 -
CodeForces - 14E Camels【DP】
题目链接:https://codeforces.com/contest/14/problem/Edp[pos][i][j][a][b]dp[pos][i][j][a][b]dp[pos][i][j][a][b]表示到第 pospospos 位, 第 pospospos 位为 iii ,第 pos−1pos-1pos−1 位为 jjj ,有 aaa 个波峰,bbb 个波谷。#include <iostream>using namespace std;long long dp[25][5][原创 2020-09-29 15:44:59 · 106 阅读 · 0 评论 -
CodeForces - 14D Two Paths【树形DP】【树的直径】
题目链接:https://codeforces.com/contest/14/problem/D枚举删边,把一棵树分成两个联通块,做两次树形dp找树的直径,取最大乘积。#include <iostream>#include <cstring>using namespace std;static const int MAXN=200+10;static const int MAXM=200*2+10;int n;int h[MAXN],e[MAXM],ne[MAXM],原创 2020-09-29 14:01:33 · 132 阅读 · 0 评论 -
CodeForces - 13C Sequence【DP】
题目链接:https://codeforces.com/contest/13/problem/C最后的序列中的元素必定是原先出现过的数字dp[i][j]dp[i][j]dp[i][j] 表示 aaa 的前iii个元素,以 bjb_jbj 结尾的最小操作数dp[1][1]=∣a1−b1∣dp[1][1]=|a_1-b_1|dp[1][1]=∣a1−b1∣dp[1][j]=min(dp[1][i−1],∣a1−bj∣)dp[1][j]=min(dp[1][i-1],|a_1-b_j|)dp[1][原创 2020-09-24 13:58:20 · 311 阅读 · 0 评论 -
CodeForces - 11D A Simple Task【状压DP】
题目链接:https://codeforces.com/contest/11/problem/D#include <iostream>using namespace std;static const int MAXN=20;long long dp[1<<MAXN][MAXN];//dp[i][j] i表示经过的点的状态 j表示结尾的点int d[MAXN][MAXN];int n,m;int main(){ scanf("%d%d",&n,&原创 2020-09-22 14:20:13 · 129 阅读 · 0 评论 -
CodeForces - 10D Digital Root【dp】
【题目描述】This problem differs from one which was on the online contest.The sequence a1, a2, …, an is called increasing, if ai < ai + 1 for i < n.The sequence s1, s2, …, sk is called the subseque...原创 2020-03-17 22:46:58 · 127 阅读 · 0 评论 -
CodeForces - 9D How many trees?【dp】
【题目描述】In one very old text file there was written Great Wisdom. This Wisdom was so Great that nobody could decipher it, even Phong — the oldest among the inhabitants of Mainframe. But still he manage...原创 2019-10-23 21:30:47 · 165 阅读 · 0 评论 -
CodeForces - 8E Beads【数位dp】
【题目描述】One Martian boy called Zorg wants to present a string of beads to his friend from the Earth — Masha. He knows that Masha likes two colours: blue and red, — and right in the shop where he has co...原创 2019-10-13 16:37:33 · 172 阅读 · 0 评论 -
CodeForces - 8C Looking for Order【状态压缩dp】
【题目描述】Girl Lena likes it when everything is in order, and looks for order everywhere. Once she was getting ready for the University and noticed that the room was in a mess — all the objects from her ...原创 2019-10-13 01:20:01 · 161 阅读 · 0 评论 -
CodeForces - 7D Palindrome Degree【字符串hash】【dp】
【题目描述】String s of length n is called k-palindrome, if it is a palindrome itself, and its prefix and suffix of length are (k - 1)-palindromes. By definition, any string (even empty) is 0-palindrome....原创 2019-10-08 08:12:32 · 296 阅读 · 0 评论 -
CodeForces - 4D Mysterious Present【dp】
【题目描述】Peter decided to wish happy birthday to his friend from Australia and send him a card. To make his present more mysterious, he decided to make a chain. Chain here is such a sequence of envelope...原创 2019-10-01 15:55:09 · 213 阅读 · 0 评论 -
CodeForces - 2B The least round way【dp】
【题目描述】There is a square matrix n × n, consisting of non-negative integer numbers. You should find such a way on it thatstarts in the upper left cell of the matrix;each following cell is to the righ...原创 2019-09-29 10:54:15 · 319 阅读 · 0 评论