摘要: F. Economic Difficulties 题目链接: https://codeforces.com/contest/1263/problem/F 题目大意: 两棵树,都有n个叶子节点,一棵树正着放,一棵树倒着放,叶子节点从左到右对应装置1,2,3,4...n,问最多能删掉多少条边,使得装置能 阅读全文
posted @ 2019-12-11 17:20 yya雨 阅读(197) 评论(0) 推荐(0) 编辑