随笔分类 - ACM-排序
摘要:https://ac.nowcoder.com/acm/contest/5674/B 题意 现在有一棵树,你要从1开始跳一遍所有的点并且每条边只能走两次,再回到1,每条边都有一个边权,你走过这条边会先消耗$w_i$点HP,每个点都有一个果子,吃掉这个果子会上升$a_i$点HP,你在任何时候的HP不能
阅读全文
摘要:Codeforces 1323D Present Catherine received an array of integers as a gift for March 8. Eventually she grew bored with it, and she started calculated
阅读全文
摘要:链接: "https://nanti.jisuanke.com/t/42582" Description Bob is hungry now and he needs to eat some food. Alice puts n dishes of food in front of him, num
阅读全文
摘要:洛谷P1309 瑞士轮 题目描述 2×N 名编号为 1 2N的选手共进行R 轮比赛。每轮比赛开始前,以及所有比赛结束后,都会按照总分从高到低对选手进行一次排名。选手的总分为第一轮开始前的初始分数加上已参加过的所有比赛的得分和。总分相同的,约定编号较小的选手排名靠前。 每轮比赛的对阵安排与该轮比赛开始
阅读全文

浙公网安备 33010602011771号