摘要:
"luogu P1136 迎接仪式" 本题的难点是状态设计, n^2 m 的状态设计转移太过垄杂,emmmm反正我写不出来QAQ 参考了题解 c++ / 相同字符不用调换,一个字符最多被调换一次否则会有等价多方案变换 dp[i][j][k]表示前i个字符,改变了j个'j'和k个'z'后的答案数 那么 阅读全文
摘要:
"luogu P4015 运输问题" c++ // luogu judger enable o2 include include include include define INF 0x7fffffff const int maxn = 2007; using std::min; using st 阅读全文
摘要:
"luogu P4012 深海机器人问题" c++ // luogu judger enable o2 include include include include define INF 0x7fffffff const int maxn = 2007; using std::min; using 阅读全文