摘要: 题目大意 一棵树,每个节点的权为L[i]\~R[i],一棵树的贡献为$\sum\limits_{h_{i} = h_{j}, 1 \le i include include include include define fo(a,b,c) for (a=b; a=c; a ) define add( 阅读全文
posted @ 2019-11-28 19:57 gmh77 阅读(216) 评论(0) 推荐(0) 编辑