1. PTT
  2. Prob_Solve

[问题] DIVCNT1 - Counting Divisors

楼主: DJWS (...)   2021-10-23 20:35:32
问题: https://www.spoj.com/problems/DIVCNT1/
解答: https://yhx-12243.github.io/OI-transit/records/spojDIVCNT1.html
算法: 给定一条凸曲线，用Stern-Brocot Tree找到一条折线，紧贴曲线上方。
我的疑问: 如何证明二分法找到的向量，恰好紧贴曲线上方?
继续阅读
[问题] AVL Tree应该先做哪种旋转？fishxd1096[问题] Sum of Three Values 使用杂凑表nevikw39[问题] 类似dp问题...？Aa841018Fw: [问题] 两题跟2的补数计算有关的问题lueichunRe: [闲聊] Hamiltonian Cycle Problem is in P？c910335[闲聊] Hamiltonian Cycle Problem is in P？alan23273850[问题] 最长回文子字串的最快算法alan23273850Re: [心得] Maximum sum k-disjoint subarraysFRAXIS[讨论] rk4 与 euler-cromer 法j0958322080[解决] UVA10505-Montesco vs Capuletofatcat8127

Links booklink

Contact Us: admin [ a t ] ucptt.com