dp还是看不懂转移方程，例如第一篇题解的

if S[i] is uppercase
	dp[i][0] <- 0
	dp[i][1] <- dp[i+1][0] + dp[i+1][1]
else if s[i] is lowercase
	dp[i][1] <- 0
	dp[i][0] <- dp[i+1][0]
else if s[i] is ?
	dp[i][1] <- (dp[i+1][0] + dp[i+1][1]) * 26
	dp[i][0] <- dp[i+1][0] * 26

求问为什么dp[i][1] <- dp[i+1][0] + dp[i+1][1]之类qwq

话说，有经常打ABC的dalao嘛qwq