https://111qqz.com/en/tags/%E6%9C%80%E5%A4%A7%E8%BF%9E%E7%BB%AD%E5%92%8C/Recent content in 最大连续和 on 111qqz's blogHugo -- gohugo.ioen© 2015-2026 111qqzMon, 18 Jul 2016 12:06:00 +0000https://111qqz.com/en/post/acm-icpc/2016/2016-07-18-cf682c/Mon, 18 Jul 2016 12:06:00 +0000https://111qqz.com/en/post/acm-icpc/2016/2016-07-18-cf682c/<p><a href="http://codeforces.com/problemset/problem/682/C" target="_blank" rel="noreferrer">cf682C题目链接</a></p> <p>题意：给一棵树。。有点权和边权。。。如果一个点v的子树中存在某点u,满足dis(u,v)&gt;a[u]，那么点v就非常sad&hellip;</p>