G.D.Retop的专栏

书中已经提到了用背包方法解，复杂度为V*N*max(C),空间复杂度为O(v)这里想了一些其它方法以及谈谈书中提到的贪心算法方法1： 采用单调队列优化复杂度为O(V*n),空间为2*V单调队列优化方法参考背包九讲。是可以实现的。但n很大的时候，就不是很好了方法2：二进制表示法优化复杂度O(V*N*log(C)),空间为V同样参考背包九讲，对C分解成1,2,4,8

Delicious ApplesTime Limit: 5000/3000 MS (Java/Others)    Memory Limit: 524288/524288 K (Java/Others)Total Submission(s): 311    Accepted Submission(s): 92Problem DescriptionThere are

Candy DistributionTime Limit: 4000/2000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 217    Accepted Submission(s): 73Problem DescriptionWY has n k

题目：x,y两个串，求x有多少个子序列在y的子序列中出现，且x的子序列满足长度为x和y最长子序列的长度用dp[i][j]表示x的i位置和y的j位置的最长公共子序列长度。求出dp[i][j]然后num[i][j]表示x的前i个字符构成的长度为dp[i][j]的子序列中，有多少个出现在y前j个字符构成的长度为dp[i][j]的子序列里。如果dp[i][j] == dp[i-1][1

题意：给三个骰子，骰子有k1,k2,k3个面。每次掷骰子，得到的点数和为前进的步数，如果掷骰子的结果为c1,c2,c3（有序）则回到原点。从0点出发，到达大于N的点，则游戏结束。求掷骰子次数的期望。转移方程为：              dp[i] = dp[i+l1+l2+l3]*(1/k1/k2/k3)+dp[0]*(1/k1/k2/k3)+1其中枚举l1,l2,l3为掷骰子得

网上多是一行一行处理的，其实因为距离为2，可以把图分为奇数点和偶数点，分成两张图，这两张图的点互不影响用插头dp dp[i][j] 表示前i个点能到达j的状态，判断i+1个点时根据这个点是否能放士兵，以及上方位置，左上方位置，右上方位置，左方位置有无士兵来决定这个位置是否可以放置士兵。奇偶图分别dp，每次dp复杂度 = （n*m*2^m) 因为有效的状态并不多（170）， 还可以删除一些无用

GroupsTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1282    Accepted Submission(s): 493Problem Description　　After the regional

A Bit FunTime Limit: 5000/2500 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2092    Accepted Submission(s): 1040Problem DescriptionThere are n numb

LightTime Limit: 18000/9000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 105    Accepted Submission(s): 42Problem DescriptionTeacher Mai has a board of

#include#include#includeusing namespace std;#define max(x,y) x>y?x:y#define maxn 1507#define ll long longll dp[maxn][maxn];ll n,dg,db,dr,st;void init(int tt){ ll t1,t2,ans=0; memset(d

#include#include#include#include#includeusing namespace std;#define maxn 1<<21#define mod 1000000007#define ll long longll dp[2][maxn];void add(ll&a,ll b){ a+=b; if(a >= mod) a-=mod

#include#include#include#includeusing namespace std;#define maxn 1<<15#define ll int#define mod 1000000007ll dp[2][maxn];int con[maxn][5];int ID[200];int value[20];char word[20];int queue

概率dp

Boring ClassTime Limit: 6000/3000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 354    Accepted Submission(s): 75Problem DescriptionMr. Zstu and Mr.

Route StatisticsTime Limit: 4000/2000 MS (Java/Others)    Memory Limit: 262144/262144 K (Java/Others)Total Submission(s): 66    Accepted Submission(s): 22Problem DescriptionJRY is so r

Candy DistributionTime Limit: 4000/2000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 37    Accepted Submission(s): 7Problem DescriptionWY has n kin

Victor and WorldTime Limit: 4000/2000 MS (Java/Others)    Memory Limit: 262144/131072 K (Java/Others)Total Submission(s): 385    Accepted Submission(s): 160Problem DescriptionAfter try

Just A StringTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 221    Accepted Submission(s): 40Problem Descriptionsoda has a ra

CRB and PuzzleTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 69    Accepted Submission(s): 35Problem DescriptionCRB is now play

Removed IntervalTime Limit: 4000/2000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 849    Accepted Submission(s): 310Problem DescriptionGiven a seq

CRB and AppleTime Limit: 12000/6000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 358    Accepted Submission(s): 109Problem DescriptionIn Codeland t

CRB and His BirthdayTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 132    Accepted Submission(s): 72Problem DescriptionToday is

ExpressionTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 372    Accepted Submission(s): 209Problem DescriptionTeacher Mai has n

Zero EscapeTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 207    Accepted Submission(s): 91Problem DescriptionZero Escape, is

Leader in Tree LandTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 169    Accepted Submission(s): 62Problem DescriptionTree land

Gray codeTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 369    Accepted Submission(s): 205Problem DescriptionThe reflected bina

Hotaru's problemTime Limit: 4000/2000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 243    Accepted Submission(s): 61Problem DescriptionHotaru Ichij

import java.util.*;/** * https://zh.wikipedia.org/zh-hans/%E7%BB%B4%E7%89%B9%E6%AF%94%E7%AE%97%E6%B3%95 * https://vimsky.com/article/863.html * @author gdretop * @date 2019/7/12 */public cla...