codeforces contest 785 b题

最新推荐文章于 2020-05-08 21:11:53 发布

creatorx

最新推荐文章于 2020-05-08 21:11:53 发布

阅读量236

点赞数

分类专栏：水题贪心

本文链接：https://blog.csdn.net/creatorx/article/details/62439226

版权

Anton需要在n个不同的时间段上象棋课，并在m个时间段上编程课。他想找到两者间隔最大的时间。输入包含每个课程的时间段，输出为最大间隔。解题策略是找出所有象棋课的最早结束时间和最晚开始时间，以及所有编程课的最晚开始时间和最早结束时间，然后找出最大间隔。

摘要由CSDN通过智能技术生成

B. Anton and Classes
time limit per test4 seconds
memory limit per test256 megabytes
inputstandard input
outputstandard output
Anton likes to play chess. Also he likes to do programming. No wonder that he decided to attend chess classes and programming classes.

Anton has n variants when he will attend chess classes, i-th variant is given by a period of time (l1, i, r1, i). Also he has m variants when he will attend programming classes, i-th variant is given by a period of time (l2, i, r2, i).

Anton needs to choose exactly one of n possible periods of time when he will attend chess classes and exactly one of m possible periods of time when he will attend programming classes. He wants to have a rest between classes, so from all the possible pairs of the periods he wants to choose the one where the distance between the periods is maximal.

The distance between periods (l1, r1) and (l2, r2) is the minimal possible distance betwee