File failed to load: https://cdn.bootcss.com/mathjax/2.7.5/extensions/MathZoom.js

08 2023 档案

23牛客多校9 I Non-Puzzle: Segment Pair
摘要：也许更好的阅读体验 \(\mathcal{Description}\) 给\(n\)对区间，要求每对区间恰好选一个使得选出来的\(n\)个区间有交集，问有多少方案数 \(1\le n, l_i,r_i\le 5×10^5\) \(\mathcal{Solution}\) 注意到区间的值域也是\(5× 阅读全文
posted @ 2023-08-14 18:50 Morning_Glory 阅读(279) 评论(0) 推荐(1) 编辑
ABC245E Wrapping Chocolate [线段树二分]
摘要：[也许更好的阅读体验](https://blog.csdn.net/Morning_Glory_JR/article/details/132194133?csdn_share_tail=%7B%22type%22%3A%22blog%22%2C%22rType%22%3A%22article%22% 阅读全文
posted @ 2023-08-09 18:16 Morning_Glory 阅读(29) 评论(0) 推荐(1) 编辑
P4381 [IOI2008] Island （求基环树直径）
摘要：[也许更好的阅读体验](https://blog.csdn.net/Morning_Glory_JR/article/details/132188251?csdn_share_tail=%7B%22type%22%3A%22blog%22%2C%22rType%22%3A%22article%22% 阅读全文
posted @ 2023-08-09 15:27 Morning_Glory 阅读(47) 评论(0) 推荐(0) 编辑
2023广东省赛B Base Station Construction
摘要：[也许更好的阅读体验](https://blog.csdn.net/Morning_Glory_JR/article/details/132123369?csdn_share_tail=%7B%22type%22%3A%22blog%22%2C%22rType%22%3A%22article%22% 阅读全文
posted @ 2023-08-05 19:04 Morning_Glory 阅读(188) 评论(0) 推荐(0) 编辑
2022ICPC南京站 B. Ropeway
摘要：[也许更好的阅读体验](https://blog.csdn.net/Morning_Glory_JR/article/details/132123173?csdn_share_tail=%7B%22type%22%3A%22blog%22%2C%22rType%22%3A%22article%22% 阅读全文
posted @ 2023-08-05 18:46 Morning_Glory 阅读(174) 评论(0) 推荐(0) 编辑

//
点击右上角即可分享
微信分享提示