- 博客(1)
- 收藏
- 关注
原创 hdu 2600 war
题目如下(给大区间,和n个小区间,求最大的未被小区间覆盖的下标) Input For each test case, first input one integer N(1<= N <= 100), then two integers p and q (-6000000 <= p <= q <= 6000000) represent the starting year and the ending year in this case. Followed by N wars.
2020-05-26 14:31:37
115
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人