该博客探讨如何使用计算几何和半平面交来解决POJ 1755 Triathlon比赛的线性规划问题。通过设定不同的赛道长度，判断每个选手是否有可能赢得比赛。博主提供了算法实现，包括建立不等式方程组和半平面交的计算方法，并给出了样例输入和输出。
Triathlon is an athletic contest consisting of three consecutive sections that should be completed as fast as possible as a whole. The first section is swimming, the second section is riding bicycle and the third one is running.
The speed of each contestant in all three sections is known. The judge can choose the length of each section arbitrarily provided that no section has zero length. As a result sometimes she could choose their lengths in such a way that some particular contestant would win the competition.
The speed of each contestant in all three sections is known. The judge can choose the length of each section arbitrarily provided that no section has zero length. As a result sometimes she could choose their lengths in such a way that some particular contestant would win the competition.
The first line of the input file contains integer number N (1 <= N <= 100), denoting the number of contestants. Then N lines follow, each line contains three integers Vi, Ui and Wi (1 <= Vi, Ui, Wi <= 10000), separated by spaces, denoting the spee
最低0.47元/天 解锁文章
5574
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
