№ | Пользователь | Рейтинг |
---|---|---|
1 | tourist | 3985 |
2 | jiangly | 3814 |
3 | jqdai0815 | 3682 |
4 | Benq | 3529 |
5 | orzdevinwang | 3526 |
6 | ksun48 | 3517 |
7 | Radewoosh | 3410 |
8 | hos.lyric | 3399 |
9 | ecnerwala | 3392 |
9 | Um_nik | 3392 |
Страны | Города | Организации | Всё → |
№ | Пользователь | Вклад |
---|---|---|
1 | cry | 169 |
2 | maomao90 | 162 |
2 | Um_nik | 162 |
4 | atcoder_official | 161 |
5 | djm03178 | 158 |
6 | -is-this-fft- | 157 |
7 | adamant | 155 |
8 | awoo | 154 |
8 | Dominater069 | 154 |
10 | luogu_official | 151 |
mkagenius
|
14 лет назад,
#
|
0
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 :) )
→
Ответить
|
MarioYC
|
14 лет назад,
#
^
|
0
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. :)
→
Ответить
|
Название |
---|