题目链接 http://noi-test.zzstep.com/contest/0x08%E3%80%8C%E5%9F%BA%E6%9C%AC%E7%AE%97%E6%B3%95%E3%80%8D%E7%BB%83%E4%B9%A0/0802%20%E5%8D%A0%E5%8D%9CDIY 分析 根据题意模拟即可 AC代码 #include <cstdio> const int maxn = 15, maxc = 5; int down[maxn][maxc], up[maxn]; inline int num(char c) { if (c == 'A') return 1