![](https://img-blog.csdnimg.cn/20201014180756757.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
dp
Thinking knife
I am a zufer。
展开
-
数位dp回顾
不会数位dp的同学点这里 数位dp教学#include<bits/stdc++.h>using namespace std;#define ll long long#define lb long double#define INF 0x3f3f3f3fconst int maxn = 100035;const int mod = 1e6 + 7;int len;ll...原创 2020-03-11 21:15:17 · 121 阅读 · 0 评论 -
2019杭电多校第七场 Kejin Player(dp)
dp[i] 表示从i升到i+1的期望,j表示从i掉落后的等级dp[i] = ci*p + (1-p)*ci + (dp[j] + dp[j+1] + 。。。。。。dp[i-1] + dp[i])移项后就是转移方程#include<iostream>#include<cstring>#include<cstdio>#include<queue&g...原创 2019-08-13 11:50:59 · 106 阅读 · 0 评论 -
洛谷P1005 矩阵取数游戏(附__int128版本)(区间dp入门)
#include<iostream>#include<cstring>#include<cstdio>#include<queue>#include<cstdlib>#include<cmath>#include<stack>#include<map>#include<string...原创 2019-08-28 15:15:06 · 199 阅读 · 0 评论 -
Codeforces Round #590 (Div. 3)(有东西)
A 不说了签到题#include<iostream>#include<cstring>#include<cstdio>#include<queue>#include<cstdlib>#include<cmath>#include<stack>#include<map>#include&...原创 2019-10-03 16:01:22 · 149 阅读 · 0 评论