简洁是智慧的灵魂

摘要： /*真伤心，学的好慢啊；脑子越来越笨了，根本转不过来；回寝室去啦~~~还需继续努力啊！*///一个长方体 衍生出3个； 对总的进行排序；保证s[i].x>s[i+1].x 如果相等，则保证s[i].y>s[i+1].y;//状态转移方程：dp[i] = max{dp[j]} + s[i].h;#include #include #include #include #include #include #include #define maxn 31 struct stone{ int x; int y; int h; }s[maxn*3]; int dp[m... 阅读全文

摘要： 状态转移方程：num[p] = min(num[i]*2,num[j]*3,num[k]*5,num[l]*7);#include #include #include #include #include #include #include #define maxn 5900 int num[maxn]; char _th[][11] ={"th","st","nd","rd","th","th","th","th","th&q 阅读全文