Divide & Conquer Algorithm

优化. Slope(j,k) > -b[i]/a[i]; 令G[i] = rate[i]*f[i]，在二维平面上定义点Xi=(Fi,Gi); Slope(j,k)就是 ... 维护点集X的凸包，支持动态插入和斜率查询; 平衡树结构O(nlogn).
展开查看详情
user picture
Hafenkranich
+关注
Independent consultant specializing in database, web and M2M applications
已将链接复制至剪贴板
相关文档