# | User | Rating |
---|---|---|
1 | tourist | 3857 |
2 | jiangly | 3747 |
3 | orzdevinwang | 3706 |
4 | jqdai0815 | 3682 |
5 | ksun48 | 3591 |
6 | gamegame | 3477 |
7 | Benq | 3468 |
8 | Radewoosh | 3463 |
9 | ecnerwala | 3451 |
10 | heuristica | 3431 |
# | User | Contrib. |
---|---|---|
1 | cry | 165 |
2 | -is-this-fft- | 161 |
3 | Qingyu | 160 |
4 | Dominater069 | 158 |
5 | atcoder_official | 157 |
6 | adamant | 155 |
7 | Um_nik | 152 |
8 | djm03178 | 151 |
9 | luogu_official | 149 |
10 | awoo | 148 |
![]() mkagenius
|
14 years ago,
#
|
![]() ![]() Can this be used to find the highest point of the lowest envelope?
(i will use it in graphical method to solve two-person-zero-sum game (2Xn matrix) ) If yes , then plz tell how ? (if you have free time :) )
→
Reply
|
![]() MarioYC
|
14 years ago,
#
^
|
![]() ![]() Hi, I haven't finished reading it, but decided to share it, since I haven't heard about it before. Now, about the highest I think it wouldn't be hard to find if you have the lines which form the segments that form the lowest envelope, as far as I understand the method gives you that. :)
→
Reply
|
Name |
---|