hdu 6035 Colorful Tree 树状dp

Problem Description There is a tree with  n nodes, each of which has a type of color represented by an integer, where the color of node  i is  ci. The path between each two different nodes is unique,

>>阅读原文<<