绝尘

树形Dp的题，根据题意建树。DP[i][0] 表示以i为根节点的树的包含i的时候的所有状态点数的总和Dp[i][1] 表示包含i结点的状态数目对于一个子节点vDp[i][0] = (Dp[v][1]+1)*Dp[i][0]+Dp[v][0]*Dp[i][1]表示子节点的所有状态与i的所有的状态之间的组合（可以不组合，所以DP[v][1]+1），接下来更新i的状态数目DP[i][1] = Dp[i][

All the people in the byteland want to stand in a line in such a way that no person stands closer to the front of the line than his father. You are given the information about the people of the bytela

Archaeologists have discovered a new set of hidden caves in one of the Egyptian pyramids. The decryption of ancient hieroglyphs on the walls nearby showed that the caves structure is as follows. Ther

HDU【5832】——A water problemHDU【5833】——Zhu and 772002HDU【5834】——Magic boy Bi Luo with his excited treeHDU【5835】——DanganronpaHDU【5839】——Special TetrahedronHDU【5842】——Lweb and String

1001-【5723】——Abandoned countryTime Limit: 8000/4000 MS 【HDU5730】Shell Necklace——CDQ+FFT